Affine motion prediction-based image decoding method and apparatus using affine MVP candidate list in image coding system

ABSTRACT

A method by which a decoding apparatus performs image decoding, according to the present document, comprises the steps of: obtaining motion prediction information about a current block from a bitstream; generating an affine MVP candidate list for the current block; deriving CPMVPs for CPs of the current block on the basis of the affine MVP candidate list; deriving CPMVDs for the CPs of the current block on the basis of the motion prediction information; deriving CPMVs for the CPs of the current block on the basis of the CPMVPs and the CPMVDs; and deriving prediction samples for the current block on the basis of the CPMVs.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation Bypass of International ApplicationNo. PCT/KR2019/011733, filed Sep. 10, 2019, and claims the benefit ofU.S. Provisional Patent Application Nos. 62/729,407, filed and Sep. 10,2018, respectively, all of which are hereby incorporated by reference intheir entirety for all purposes as if fully set forth herein.

BACKGROUND OF THE DISCLOSURE Field of the Disclosure

The present disclosure relates to a video coding technique and, moreparticularly, to a video decoding method and an apparatus based onaffine motion prediction in a video coding system.

Related Art

Demand for high-resolution, high-quality images such as HD (HighDefinition) images and UHD (Ultra High Definition) images have beenincreasing in various fields. As the image data has high resolution andhigh quality, the amount of information or bits to be transmittedincreases relative to the legacy image data. Therefore, when image datais transmitted using a medium such as a conventional wired/wirelessbroadband line or image data is stored using an existing storage medium,the transmission cost and the storage cost thereof are increased.

Accordingly, there is a need for a highly efficient image compressiontechnique for effectively transmitting, storing, and reproducinginformation of high resolution and high quality images.

SUMMARY

A technical object of the present disclosure is to provide a method andan apparatus for improving video coding efficiency.

Another technical object of the present disclosure is to provide a videodecoding method and an apparatus which construct an affine MVP candidatelist of a current block by deriving constructed affine MVP candidatesbased on neighboring blocks only when all the candidate motion vectorsfor CPs are available and perform prediction of the current block basedon the constructed affine MVP candidate list.

Yet another technical object of the present disclosure is to provide avideo decoding method and an apparatus which derive an affine MVPcandidate by using a candidate motion vector derived from the processfor deriving a constructed affine MVP candidate as an added affine MVPcandidate when the number of available inherited affine MVP candidatesand constructed affine MVP candidates, that is, the number of candidatesof the MVP candidate list is less than the maximum number; and performprediction of the current block based on the constructed affine MVPcandidate list.

According to one embodiment of the present disclosure, a video decodingmethod performed by a decoding apparatus is provided. The methodcomprises obtaining motion prediction information for a current blockfrom a bitstream; constructing an affine Motion Vector Predictor (MVP)candidate list for the current block; deriving Control Point MotionVector Predictors (CPMVPs) for Control Points (CPs) of the current blockbased on the affine MVP candidate list; deriving Control Point MotionVector Differences (CPMVDs) for the CPs of the current block based onthe motion prediction information; deriving Control Point Motion Vectors(CPMVs) for the CPs of the current block based on the CPMVPs and theCPMVDs; deriving prediction samples for the current block based on theCPMVs; and generating a reconstructed picture for the current blockbased on the derived prediction samples, wherein the constructing theaffine MVP candidate list comprises checking whether an inheritedaffined MVP candidate of the current block is available, wherein theinherited affine MVP candidate is derived when the inherited affine MVPcandidate is available; checking whether a constructed affine MVPcandidate of the current block is available, wherein the constructedaffine MVP candidate is derived when the constructed affine MVPcandidate is available, and the constructed affine MVP candidateincludes a candidate motion vector for CP0 of the current block, acandidate motion vector for CP1 of the current block, and a candidatemotion vector for CP2 of the current block; when the number of derivedaffine MVP candidates is less than 2 and the motion vector for CP0 isavailable, deriving a first affine MVP candidate, wherein the firstaffine MVP candidate is an affine MVP candidate including the motionvector for the CP0 as candidate motion vectors for the CPs; when thenumber of derived affine MVP candidates is less than 2 and the motionvector for CP1 is available, deriving a second affine MVP candidate,wherein the second affine MVP candidate is an affine MVP candidateincluding the motion vector for the CP1 as candidate motion vectors forthe CPs; when the number of derived affine MVP candidates is less than 2and the motion vector for CP2 is available, deriving a third affine MVPcandidate, wherein the third affine MVP candidate is an affine MVPcandidate including the motion vector for the CP2 as candidate motionvectors for the CPs; when the number of derived affine MVP candidates isless than 2, deriving a fourth affine MVP candidate including a temporalMVP derived based on a temporal neighboring block of the current blockas candidate motion vectors for the CPs; and when the number of derivedaffine MVP candidates is less than 2, deriving a fifth affine MVPcandidate including a zero motion vector as candidate motion vectors forthe CPs.

According to another embodiment of the present disclosure, a decodingapparatus performing video coding is provided. The decoding apparatuscomprises an entropy decoder obtaining motion prediction information fora current block; a predictor constructing an affine Motion VectorPredictor (MVP) candidate list for the current block, deriving ControlPoint Motion Vector Predictors (CPMVPs) for Control Points (CPs) of thecurrent block based on the affine MVP candidate list, deriving ControlPoint Motion Vector Differences (CPMVDs) for the CPs of the currentblock based on the motion prediction information, deriving Control PointMotion Vectors (CPMVs) for the CPs of the current block based on theCPMVDs, deriving prediction samples for the current block based on theCPMVs; and an adder generating a reconstructed picture for the currentblock based on the derived prediction samples, wherein the affine MVPcandidate list is constructed based on checking whether an inheritedaffined MVP candidate of the current block is available, wherein theinherited affine MVP candidate is derived when the inherited affine MVPcandidate is available; checking whether a constructed affine MVPcandidate of the current block is available, wherein the constructedaffine MVP candidate is derived when the constructed affine MVPcandidate is available, and the constructed affine MVP candidateincludes a candidate motion vector for CP0 of the current block, acandidate motion vector for CP1 of the current block, and a candidatemotion vector for CP2 of the current block; when the number of derivedaffine MVP candidates is less than 2 and the motion vector for CP0 isavailable, deriving a first affine MVP candidate, wherein the firstaffine MVP candidate is an affine MVP candidate including the motionvector for the CP0 as candidate motion vectors for the CPs; when thenumber of derived affine MVP candidates is less than 2 and the motionvector for CP1 is available, deriving a second affine MVP candidate,wherein the second affine MVP candidate is an affine MVP candidateincluding the motion vector for the CP1 as candidate motion vectors forthe CPs; when the number of derived affine MVP candidates is less than 2and the motion vector for CP2 is available, deriving a third affine MVPcandidate, wherein the third affine MVP candidate is an affine MVPcandidate including the motion vector for the CP2 as candidate motionvectors for the CPs; when the number of derived affine MVP candidates isless than 2, deriving a fourth affine MVP candidate including a temporalMVP derived based on a temporal neighboring block of the current blockas candidate motion vectors for the CPs; and when the number of derivedaffine MVP candidates is less than 2, deriving a fifth affine MVPcandidate including a zero motion vector as candidate motion vectors forthe CPs.

According to yet another embodiment of the present disclosure, a videoencoding method performed by an encoding apparatus is provided. Themethod comprises constructing an affine Motion Vector Predictor (MVP)candidate list for a current block; deriving Control Point Motion VectorPredictors (CPMVPs) for Control Points (CPs) of the current block basedon the affine MVP candidate list; deriving CPMVs for the CPs of thecurrent block; deriving Control Point Motion Vector Differences (CPMVDs)for the CPs of the current block based on the CPMVPs and the CPMVs; andencoding motion prediction information including information on theCPMVDs, wherein the constructing the affine MVP candidate list compriseschecking whether an inherited affined MVP candidate of the current blockis available, wherein the inherited affine MVP candidate is derived whenthe inherited affine MVP candidate is available; checking whether aconstructed affine MVP candidate of the current block is available,wherein the constructed affine MVP candidate is derived when theconstructed affine MVP candidate is available, and the constructedaffine MVP candidate includes a candidate motion vector for CP0 of thecurrent block, a candidate motion vector for CP1 of the current block,and a candidate motion vector for CP2 of the current block; when thenumber of derived affine MVP candidates is less than 2 and the motionvector for CP0 is available, deriving a first affine MVP candidate,wherein the first affine MVP candidate is an affine MVP candidateincluding the motion vector for the CP0 as candidate motion vectors forthe CPs; when the number of derived affine MVP candidates is less than 2and the motion vector for CP1 is available, deriving a second affine MVPcandidate, wherein the second affine MVP candidate is an affine MVPcandidate including the motion vector for the CP1 as candidate motionvectors for the CPs; when the number of derived affine MVP candidates isless than 2 and the motion vector for CP2 is available, deriving a thirdaffine MVP candidate, wherein the third affine MVP candidate is anaffine MVP candidate including the motion vector for the CP2 ascandidate motion vectors for the CPs; when the number of derived affineMVP candidates is less than 2, deriving a fourth affine MVP candidateincluding a temporal MVP derived based on a temporal neighboring blockof the current block as candidate motion vectors for the CPs; and whenthe number of derived affine MVP candidates is less than 2, deriving afifth affine MVP candidate including a zero motion vector as candidatemotion vectors for the CPs.

According to still another embodiment of the present disclosure, a videoencoding apparatus is provided. The encoding apparatus comprises apredictor constructing an affine Motion Vector Predictor (MVP) candidatelist for a current block, deriving Control Point Motion VectorPredictors (CPMVPs) for Control Points (CPs) of the current block, andderiving CPMVs for the CPs of the current block; a subtractor derivingControl Point Motion Vector Differences (CPMVDs) for the CPs of thecurrent block based on the CPMVPs and the CPMVs; and an entropy encoderencoding motion prediction information including information on theCPMVDs, wherein the affine MVP candidate list is constructed based onchecking whether an inherited affined MVP candidate of the current blockis available, wherein the inherited affine MVP candidate is derived whenthe inherited affine MVP candidate is available; checking whether aconstructed affine MVP candidate of the current block is available,wherein the constructed affine MVP candidate is derived when theconstructed affine MVP candidate is available, and the constructedaffine MVP candidate includes a candidate motion vector for CP0 of thecurrent block, a candidate motion vector for CP1 of the current block,and a candidate motion vector for CP2 of the current block; when thenumber of derived affine MVP candidates is less than 2 and the motionvector for CP0 is available, deriving a first affine MVP candidate,wherein the first affine MVP candidate is an affine MVP candidateincluding the motion vector for the CP0 as candidate motion vectors forthe CPs; when the number of derived affine MVP candidates is less than 2and the motion vector for CP1 is available, deriving a second affine MVPcandidate, wherein the second affine MVP candidate is an affine MVPcandidate including the motion vector for the CP1 as candidate motionvectors for the CPs; when the number of derived affine MVP candidates isless than 2 and the motion vector for CP2 is available, deriving a thirdaffine MVP candidate, wherein the third affine MVP candidate is anaffine MVP candidate including the motion vector for the CP2 ascandidate motion vectors for the CPs; when the number of derived affineMVP candidates is less than 2, deriving a fourth affine MVP candidateincluding a temporal MVP derived based on a temporal neighboring blockof the current block as candidate motion vectors for the CPs; and whenthe number of derived affine MVP candidates is less than 2, deriving afifth affine MVP candidate including a zero motion vector as candidatemotion vectors for the CPs.

According to the present disclosure, the overall image/video compressionefficiency may be improved.

According to the present disclosure, efficiency of video coding based onaffine motion prediction may be improved.

According to the present disclosure, in deriving an affine MVP candidatelist, only when all the candidate motion vectors for CPs of aconstructed affine MVP candidate are available, the constructed affineMVP candidate may be added, through which complexity of deriving aconstructed affine MVP candidate and constructing an affine MVPcandidate list may be reduced and coding efficiency may be improved.

According to the present disclosure, in deriving an affine MVP candidatelist, an additional affine MVP candidate may be derived based on acandidate motion vector for a CP derived from a process for deriving aconstructed affine MVP candidate, through which complexity ofconstructing an affine MVP candidate list may be reduced and codingefficiency may be improved.

According to the present disclosure, in deriving an inherited affine MVPcandidate, only when a top neighboring block is included in a currentCTU, the inherited affine MVP candidate may be derived by using the topneighboring block, through which the amount of storage of a line bufferfor affine prediction may be reduced and hardware cost may be minimized.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an example of a video/image coding system to whichthe present disclosure may be applied.

FIG. 2 is a schematic diagram illustrating a configuration of avideo/image encoding apparatus to which the embodiment(s) of the presentdocument may be applied.

FIG. 3 is a schematic diagram illustrating a configuration of avideo/image decoding apparatus to which the embodiment(s) of the presentdocument may be applied.

FIG. 4 illustrates a motion expressed through an affine motion model.

FIG. 5 illustrates the affine motion model in which motion vectors for 3control points are used.

FIG. 6 illustrates an affine motion model in which motion vectors for 2control points are used.

FIG. 7 illustrates a method of deriving a motion vector on a sub-blockbasis based on the affine motion model.

FIG. 8 is a flowchart illustrating an affine motion prediction methodaccording to an embodiment of the present disclosure.

FIG. 9 illustrates a method for deriving a motion vector predictor at acontrol point according to one embodiment of the present disclosure.

FIG. 10 illustrates a method for deriving a motion vector predictor at acontrol point according to one embodiment of the present disclosure.

FIG. 11 illustrates one example of affine prediction performed whenneighboring block A is selected as an affine merge candidate.

FIG. 12 illustrates neighboring blocks for deriving the inherited affinecandidate.

FIG. 13 illustrates spatial candidates for the constructed affinecandidate.

FIG. 14 illustrates one example of constructing an affine MVP list.

FIG. 15 illustrates one example of deriving the constructed candidate.

FIG. 16 illustrates one example of deriving the constructed candidate.

FIG. 17 illustrates positions of neighboring blocks scanned for derivinginherited affine candidates.

FIG. 18 illustrates one example of deriving the constructed candidatewhen four-parameter affine motion model is applied to the current block.

FIG. 19 illustrates one example of deriving the constructed candidatewhen six-parameter affine motion model is applied to the current block.

FIGS. 20a to 20b illustrate an embodiment for deriving the inheritedaffine candidate.

FIG. 21 illustrates a video encoding method performed by encodingapparatus according to the present disclosure.

FIG. 22 illustrates an encoding apparatus performing a video encodingmethod according to the present disclosure.

FIG. 23 illustrates a video decoding method performed by a decodingapparatus according to the present disclosure.

FIG. 24 illustrates a decoding apparatus performing a video decodingmethod according to the present disclosure.

FIG. 25 illustrates a content streaming system structure to whichembodiments of the present disclosure are applied.

DESCRIPTION OF EXEMPLARY EMBODIMENTS

The present disclosure may be modified in various forms, and specificembodiments thereof will be described and illustrated in the drawings.However, the embodiments are not intended for limiting the disclosure.The terms used in the following description are used to merely describespecific embodiments but are not intended to limit the disclosure. Anexpression of a singular number includes an expression of the pluralnumber, so long as it is clearly read differently. The terms such as“include” and “have” are intended to indicate that features, numbers,steps, operations, elements, components, or combinations thereof used inthe following description exist and it should be thus understood thatthe possibility of existence or addition of one or more differentfeatures, numbers, steps, operations, elements, components, orcombinations thereof is not excluded.

On the other hand, elements in the drawings described in the disclosureare independently drawn for the purpose of convenience for explanationof different specific functions, and do not mean that the elements areembodied by independent hardware or independent software. For example,two or more elements of the elements may be combined to form a singleelement, or one element may be divided into plural elements. Theembodiments in which the elements are combined and/or divided belong tothe disclosure without departing from the concept of the disclosure.

Hereinafter, embodiments of the present disclosure will be described indetail with reference to the accompanying drawings. In addition, likereference numerals are used to indicate like elements throughout thedrawings, and the same descriptions on the like elements will beomitted.

FIG. 1 illustrates an example of a video/image coding system to whichthe present disclosure may be applied.

Referring to FIG. 1, a video/image coding system may include a firstdevice (source device) and a second device (receiving device). Thesource device may deliver encoded video/image information or data in theform of a file or streaming to the receiving device via a digitalstorage medium or network.

The source device may include a video source, an encoding apparatus, anda transmitter. The receiving device may include a receiver, a decodingapparatus, and a renderer. The encoding apparatus may be called avideo/image encoding apparatus, and the decoding apparatus may be calleda video/image decoding apparatus. The transmitter may be included in theencoding apparatus. The receiver may be included in the decodingapparatus. The renderer may include a display, and the display may beconfigured as a separate device or an external component.

The video source may acquire video/image through a process of capturing,synthesizing, or generating the video/image. The video source mayinclude a video/image capture device and/or a video/image generatingdevice. The video/image capture device may include, for example, one ormore cameras, video/image archives including previously capturedvideo/images, and the like. The video/image generating device mayinclude, for example, computers, tablets and smartphones, and may(electronically) generate video/images. For example, a virtualvideo/image may be generated through a computer or the like. In thiscase, the video/image capturing process may be replaced by a process ofgenerating related data.

The encoding apparatus may encode input video/image. The encodingapparatus may perform a series of procedures such as prediction,transform, and quantization for compression and coding efficiency. Theencoded data (encoded video/image information) may be output in the formof a bitstream.

The transmitter may transmit the encoded image/image information or dataoutput in the form of a bitstream to the receiver of the receivingdevice through a digital storage medium or a network in the form of afile or streaming. The digital storage medium may include variousstorage mediums such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and thelike. The transmitter may include an element for generating a media filethrough a predetermined file format and may include an element fortransmission through a broadcast/communication network. The receiver mayreceive/extract the bitstream and transmit the received bitstream to thedecoding apparatus.

The decoding apparatus may decode the video/image by performing a seriesof procedures such as dequantization, inverse transform, and predictioncorresponding to the operation of the encoding apparatus.

The renderer may render the decoded video/image. The renderedvideo/image may be displayed through the display.

This document relates to video/image coding. For example, themethods/embodiments disclosed in this document may be applied to amethod disclosed in the versatile video coding (VVC), the EVC (essentialvideo coding) standard, the AOMedia Video 1 (AV1) standard, the 2ndgeneration of audio video coding standard (AVS2), or the next generationvideo/image coding standard (ex. H.267 or H.268, etc.).

This document presents various embodiments of video/image coding, andthe embodiments may be performed in combination with each other unlessotherwise mentioned.

In this document, video may refer to a series of images over time.Picture generally refers to a unit representing one image in a specifictime zone, and a slice/tile is a unit constituting part of a picture incoding. The slice/tile may include one or more coding tree units (CTUs).One picture may consist of one or more slices/tiles. One picture mayconsist of one or more tile groups. One tile group may include one ormore tiles. A brick may represent a rectangular region of CTU rowswithin a tile in a picture. A tile may be partitioned into multiplebricks, each of which consisting of one or more CTU rows within thetile. A tile that is not partitioned into multiple bricks may be alsoreferred to as a brick. A brick scan is a specific sequential orderingof CTUs partitioning a picture in which the CTUs are orderedconsecutively in CTU raster scan in a brick, bricks within a tile areordered consecutively in a raster scan of the bricks of the tile, andtiles in a picture are ordered consecutively in a raster scan of thetiles of the picture. A tile is a rectangular region of CTUs within aparticular tile column and a particular tile row in a picture. The tilecolumn is a rectangular region of CTUs having a height equal to theheight of the picture and a width specified by syntax elements in thepicture parameter set. The tile row is a rectangular region of CTUshaving a height specified by syntax elements in the picture parameterset and a width equal to the width of the picture. A tile scan is aspecific sequential ordering of CTUs partitioning a picture in which theCTUs are ordered consecutively in CTU raster scan in a tile whereastiles in a picture are ordered consecutively in a raster scan of thetiles of the picture. A slice includes an integer number of bricks of apicture that may be exclusively contained in a single NAL unit. A slicemay consist of either a number of complete tiles or only a consecutivesequence of complete bricks of one tile. Tile groups and slices may beused interchangeably in this document. For example, in this document, atile group/tile group header may be called a slice/slice header.

A pixel or a pel may mean a smallest unit constituting one picture (orimage). Also, ‘sample’ may be used as a term corresponding to a pixel. Asample may generally represent a pixel or a value of a pixel and mayrepresent only a pixel/pixel value of a luma component or only apixel/pixel value of a chroma component.

A unit may represent a basic unit of image processing. The unit mayinclude at least one of specific regions of the picture and informationrelated to the region. One unit may include one luma block and twochroma (ex. cb, cr) blocks. The unit may be used interchangeably withterms such as block or area in some cases. In a general case, an M×Nblock may include samples (or sample arrays) or a set (or array) oftransform coefficients of M columns and N rows.

In this document, the term “/” and “,” should be interpreted to indicate“and/or.” For instance, the expression “A/B” may mean “A and/or B.”Further, “A, B” may mean “A and/or B.” Further, “A/B/C” may mean “atleast one of A, B, and/or C.” Also, “A/B/C” may mean “at least one of A,B, and/or C.”

Further, in the document, the term “or” should be interpreted toindicate “and/or.” For instance, the expression “A or B” may comprise 1)only A, 2) only B, and/or 3) both A and B. In other words, the term “or”in this document should be interpreted to indicate “additionally oralternatively.”

FIG. 2 is a schematic diagram illustrating a configuration of avideo/image encoding apparatus to which the embodiment(s) of the presentdocument may be applied. Hereinafter, the video encoding apparatus mayinclude an image encoding apparatus.

Referring to FIG. 2, the encoding apparatus 200 includes an imagepartitioner 210, a predictor 220, a residual processor 230, and anentropy encoder 240, an adder 250, a filter 260, and a memory 270. Thepredictor 220 may include an inter predictor 221 and an intra predictor222. The residual processor 230 may include a transformer 232, aquantizer 233, a dequantizer 234, and an inverse transformer 235. Theresidual processor 230 may further include a subtractor 231. The adder250 may be called a reconstructor or a reconstructed block generator.The image partitioner 210, the predictor 220, the residual processor230, the entropy encoder 240, the adder 250, and the filter 260 may beconfigured by at least one hardware component (ex. an encoder chipset orprocessor) according to an embodiment. In addition, the memory 270 mayinclude a decoded picture buffer (DPB) or may be configured by a digitalstorage medium. The hardware component may further include the memory270 as an internal/external component.

The image partitioner 210 may partition an input image (or a picture ora frame) input to the encoding apparatus 200 into one or moreprocessors. For example, the processor may be called a coding unit (CU).In this case, the coding unit may be recursively partitioned accordingto a quad-tree binary-tree ternary-tree (QTBTTT) structure from a codingtree unit (CTU) or a largest coding unit (LCU). For example, one codingunit may be partitioned into a plurality of coding units of a deeperdepth based on a quad tree structure, a binary tree structure, and/or aternary structure. In this case, for example, the quad tree structuremay be applied first, and the binary tree structure and/or ternarystructure may be applied later. Alternatively, the binary tree structuremay be applied first. The coding procedure according to this documentmay be performed based on the final coding unit that is no longerpartitioned. In this case, the largest coding unit may be used as thefinal coding unit based on coding efficiency according to imagecharacteristics, or if necessary, the coding unit may be recursivelypartitioned into coding units of deeper depth and a coding unit havingan optimal size may be used as the final coding unit. Here, the codingprocedure may include a procedure of prediction, transform, andreconstruction, which will be described later. As another example, theprocessor may further include a prediction unit (PU) or a transform unit(TU). In this case, the prediction unit and the transform unit may besplit or partitioned from the aforementioned final coding unit. Theprediction unit may be a unit of sample prediction, and the transformunit may be a unit for deriving a transform coefficient and/or a unitfor deriving a residual signal from the transform coefficient.

The unit may be used interchangeably with terms such as block or area insome cases. In a general case, an M×N block may represent a set ofsamples or transform coefficients composed of M columns and N rows. Asample may generally represent a pixel or a value of a pixel, mayrepresent only a pixel/pixel value of a luma component or represent onlya pixel/pixel value of a chroma component. A sample may be used as aterm corresponding to one picture (or image) for a pixel or a pel.

In the encoding apparatus 200, a prediction signal (predicted block,prediction sample array) output from the inter predictor 221 or theintra predictor 222 is subtracted from an input image signal (originalblock, original sample array) to generate a residual signal residualblock, residual sample array), and the generated residual signal istransmitted to the transformer 232. In this case, as shown, a unit forsubtracting a prediction signal (predicted block, prediction samplearray) from the input image signal (original block, original samplearray) in the encoder 200 may be called a subtractor 231. The predictormay perform prediction on a block to be processed (hereinafter, referredto as a current block) and generate a predicted block includingprediction samples for the current block. The predictor may determinewhether intra prediction or inter prediction is applied on a currentblock or CU basis. As described later in the description of eachprediction mode, the predictor may generate various information relatedto prediction, such as prediction mode information, and transmit thegenerated information to the entropy encoder 240. The information on theprediction may be encoded in the entropy encoder 240 and output in theform of a bitstream.

The intra predictor 222 may predict the current block by referring tothe samples in the current picture. The referred samples may be locatedin the neighborhood of the current block or may be located apartaccording to the prediction mode. In the intra prediction, predictionmodes may include a plurality of non-directional modes and a pluralityof directional modes. The non-directional mode may include, for example,a DC mode and a planar mode. The directional mode may include, forexample, 33 directional prediction modes or 65 directional predictionmodes according to the degree of detail of the prediction direction.However, this is merely an example, more or less directional predictionmodes may be used depending on a setting. The intra predictor 222 maydetermine the prediction mode applied to the current block by using aprediction mode applied to a neighboring block.

The inter predictor 221 may derive a predicted block for the currentblock based on a reference block (reference sample array) specified by amotion vector on a reference picture. Here, in order to reduce theamount of motion information transmitted in the inter prediction mode,the motion information may be predicted in units of blocks, subblocks,or samples based on correlation of motion information between theneighboring block and the current block. The motion information mayinclude a motion vector and a reference picture index. The motioninformation may further include inter prediction direction (L0prediction, L1 prediction, Bi prediction, etc.) information. In the caseof inter prediction, the neighboring block may include a spatialneighboring block present in the current picture and a temporalneighboring block present in the reference picture. The referencepicture including the reference block and the reference pictureincluding the temporal neighboring block may be the same or different.The temporal neighboring block may be called a collocated referenceblock, a co-located CU (colCU), and the like, and the reference pictureincluding the temporal neighboring block may be called a collocatedpicture (colPic). For example, the inter predictor 221 may configure amotion information candidate list based on neighboring blocks andgenerate information indicating which candidate is used to derive amotion vector and/or a reference picture index of the current block.Inter prediction may be performed based on various prediction modes. Forexample, in the case of a skip mode and a merge mode, the interpredictor 221 may use motion information of the neighboring block asmotion information of the current block. In the skip mode, unlike themerge mode, the residual signal may not be transmitted. In the case ofthe motion vector prediction (MVP) mode, the motion vector of theneighboring block may be used as a motion vector predictor and themotion vector of the current block may be indicated by signaling amotion vector difference.

The predictor 220 may generate a prediction signal based on variousprediction methods described below. For example, the predictor may notonly apply intra prediction or inter prediction to predict one block butalso simultaneously apply both intra prediction and inter prediction.This may be called combined inter and intra prediction (CIIP). Inaddition, the predictor may be based on an intra block copy (IBC)prediction mode or a palette mode for prediction of a block. The IBCprediction mode or palette mode may be used for content image/videocoding of a game or the like, for example, screen content coding (SCC).The IBC basically performs prediction in the current picture but may beperformed similarly to inter prediction in that a reference block isderived in the current picture. That is, the IBC may use at least one ofthe inter prediction techniques described in this document. The palettemode may be considered as an example of intra coding or intraprediction. When the palette mode is applied, a sample value within apicture may be signaled based on information on the palette table andthe palette index.

The prediction signal generated by the predictor (including the interpredictor 221 and/or the intra predictor 222) may be used to generate areconstructed signal or to generate a residual signal. The transformer232 may generate transform coefficients by applying a transformtechnique to the residual signal. For example, the transform techniquemay include at least one of a discrete cosine transform (DCT), adiscrete sine transform (DST), a karhunen-loeve transform (KLT), agraph-based transform (GBT), or a conditionally non-linear transform(CNT). Here, the GBT means transform obtained from a graph whenrelationship information between pixels is represented by the graph. TheCNT refers to transform generated based on a prediction signal generatedusing all previously reconstructed pixels. In addition, the transformprocess may be applied to square pixel blocks having the same size ormay be applied to blocks having a variable size rather than square.

The quantizer 233 may quantize the transform coefficients and transmitthem to the entropy encoder 240 and the entropy encoder 240 may encodethe quantized signal (information on the quantized transformcoefficients) and output a bitstream. The information on the quantizedtransform coefficients may be referred to as residual information. Thequantizer 233 may rearrange block type quantized transform coefficientsinto a one-dimensional vector form based on a coefficient scanning orderand generate information on the quantized transform coefficients basedon the quantized transform coefficients in the one-dimensional vectorform. Information on transform coefficients may be generated. Theentropy encoder 240 may perform various encoding methods such as, forexample, exponential Golomb, context-adaptive variable length coding(CAVLC), context-adaptive binary arithmetic coding (CABAC), and thelike. The entropy encoder 240 may encode information necessary forvideo/image reconstruction other than quantized transform coefficients(ex. values of syntax elements, etc.) together or separately. Encodedinformation (ex. encoded video/image information) may be transmitted orstored in units of NALs (network abstraction layer) in the form of abitstream. The video/image information may further include informationon various parameter sets such as an adaptation parameter set (APS), apicture parameter set (PPS), a sequence parameter set (SPS), or a videoparameter set (VPS). In addition, the video/image information mayfurther include general constraint information. In this document,information and/or syntax elements transmitted/signaled from theencoding apparatus to the decoding apparatus may be included invideo/picture information. The video/image information may be encodedthrough the above-described encoding procedure and included in thebitstream. The bitstream may be transmitted over a network or may bestored in a digital storage medium. The network may include abroadcasting network and/or a communication network, and the digitalstorage medium may include various storage media such as USB, SD, CD,DVD, Blu-ray, HDD, SSD, and the like. A transmitter (not shown)transmitting a signal output from the entropy encoder 240 and/or astorage medium (not shown) storing the signal may be included asinternal/external element of the encoding apparatus 200, andalternatively, the transmitter may be included in the entropy encoder240.

The quantized transform coefficients output from the quantizer 233 maybe used to generate a prediction signal. For example, the residualsignal (residual block or residual samples) may be reconstructed byapplying dequantization and inverse transform to the quantized transformcoefficients through the dequantizer 234 and the inverse transformer235. The adder 250 adds the reconstructed residual signal to theprediction signal output from the inter predictor 221 or the intrapredictor 222 to generate a reconstructed signal (reconstructed picture,reconstructed block, reconstructed sample array). If there is noresidual for the block to be processed, such as a case where the skipmode is applied, the predicted block may be used as the reconstructedblock. The adder 250 may be called a reconstructor or a reconstructedblock generator. The generated reconstructed signal may be used forintra prediction of a next block to be processed in the current pictureand may be used for inter prediction of a next picture through filteringas described below.

Meanwhile, luma mapping with chroma scaling (LMCS) may be applied duringpicture encoding and/or reconstruction.

The filter 260 may improve subjective/objective image quality byapplying filtering to the reconstructed signal. For example, the filter260 may generate a modified reconstructed picture by applying variousfiltering methods to the reconstructed picture and store the modifiedreconstructed picture in the memory 270, specifically, a DPB of thememory 270. The various filtering methods may include, for example,deblocking filtering, a sample adaptive offset, an adaptive loop filter,a bilateral filter, and the like. The filter 260 may generate variousinformation related to the filtering and transmit the generatedinformation to the entropy encoder 240 as described later in thedescription of each filtering method. The information related to thefiltering may be encoded by the entropy encoder 240 and output in theform of a bitstream.

The modified reconstructed picture transmitted to the memory 270 may beused as the reference picture in the inter predictor 221. When the interprediction is applied through the encoding apparatus, predictionmismatch between the encoding apparatus 200 and the decoding apparatusmay be avoided and encoding efficiency may be improved.

The DPB of the memory 270 DPB may store the modified reconstructedpicture for use as a reference picture in the inter predictor 221. Thememory 270 may store the motion information of the block from which themotion information in the current picture is derived (or encoded) and/orthe motion information of the blocks in the picture that have alreadybeen reconstructed. The stored motion information may be transmitted tothe inter predictor 221 and used as the motion information of thespatial neighboring block or the motion information of the temporalneighboring block. The memory 270 may store reconstructed samples ofreconstructed blocks in the current picture and may transfer thereconstructed samples to the intra predictor 222.

FIG. 3 is a schematic diagram illustrating a configuration of avideo/image decoding apparatus to which the embodiment(s) of the presentdocument may be applied.

Referring to FIG. 3, the decoding apparatus 300 may include an entropydecoder 310, a residual processor 320, a predictor 330, an adder 340, afilter 350, a memory 360. The predictor 330 may include an interpredictor 332 and an intra predictor 331. The residual processor 320 mayinclude a dequantizer 321 and an inverse transformer 322. The entropydecoder 310, the residual processor 320, the predictor 330, the adder340, and the filter 350 may be configured by a hardware component (ex. adecoder chipset or a processor) according to an embodiment. In addition,the memory 360 may include a decoded picture buffer (DPB) or may beconfigured by a digital storage medium. The hardware component mayfurther include the memory 360 as an internal/external component.

When a bitstream including video/image information is input, thedecoding apparatus 300 may reconstruct an image corresponding to aprocess in which the video/image information is processed in theencoding apparatus of FIG. 2. For example, the decoding apparatus 300may derive units/blocks based on block partition related informationobtained from the bitstream. The decoding apparatus 300 may performdecoding using a processor applied in the encoding apparatus. Thus, theprocessor of decoding may be a coding unit, for example, and the codingunit may be partitioned according to a quad tree structure, binary treestructure and/or ternary tree structure from the coding tree unit or thelargest coding unit. One or more transform units may be derived from thecoding unit. The reconstructed image signal decoded and output throughthe decoding apparatus 300 may be reproduced through a reproducingapparatus.

The decoding apparatus 300 may receive a signal output from the encodingapparatus of FIG. 2 in the form of a bitstream, and the received signalmay be decoded through the entropy decoder 310. For example, the entropydecoder 310 may parse the bitstream to derive information (ex.video/image information) necessary for image reconstruction (or picturereconstruction). The video/image information may further includeinformation on various parameter sets such as an adaptation parameterset (APS), a picture parameter set (PPS), a sequence parameter set(SPS), or a video parameter set (VPS). In addition, the video/imageinformation may further include general constraint information. Thedecoding apparatus may further decode picture based on the informationon the parameter set and/or the general constraint information.Signaled/received information and/or syntax elements described later inthis document may be decoded may decode the decoding procedure andobtained from the bitstream. For example, the entropy decoder 310decodes the information in the bitstream based on a coding method suchas exponential Golomb coding, CAVLC, or CABAC, and output syntaxelements required for image reconstruction and quantized values oftransform coefficients for residual. More specifically, the CABACentropy decoding method may receive a bin corresponding to each syntaxelement in the bitstream, determine a context model using a decodingtarget syntax element information, decoding information of a decodingtarget block or information of a symbol/bin decoded in a previous stage,and perform an arithmetic decoding on the bin by predicting aprobability of occurrence of a bin according to the determined contextmodel, and generate a symbol corresponding to the value of each syntaxelement. In this case, the CABAC entropy decoding method may update thecontext model by using the information of the decoded symbol/bin for acontext model of a next symbol/bin after determining the context model.The information related to the prediction among the information decodedby the entropy decoder 310 may be provided to the predictor (the interpredictor 332 and the intra predictor 331), and the residual value onwhich the entropy decoding was performed in the entropy decoder 310,that is, the quantized transform coefficients and related parameterinformation, may be input to the residual processor 320. The residualprocessor 320 may derive the residual signal (the residual block, theresidual samples, the residual sample array). In addition, informationon filtering among information decoded by the entropy decoder 310 may beprovided to the filter 350. Meanwhile, a receiver (not shown) forreceiving a signal output from the encoding apparatus may be furtherconfigured as an internal/external element of the decoding apparatus300, or the receiver may be a component of the entropy decoder 310.Meanwhile, the decoding apparatus according to this document may bereferred to as a video/image/picture decoding apparatus, and thedecoding apparatus may be classified into an information decoder(video/image/picture information decoder) and a sample decoder(video/image/picture sample decoder). The information decoder mayinclude the entropy decoder 310, and the sample decoder may include atleast one of the dequantizer 321, the inverse transformer 322, the adder340, the filter 350, the memory 360, the inter predictor 332, and theintra predictor 331.

The dequantizer 321 may dequantize the quantized transform coefficientsand output the transform coefficients. The dequantizer 321 may rearrangethe quantized transform coefficients in the form of a two-dimensionalblock form. In this case, the rearrangement may be performed based onthe coefficient scanning order performed in the encoding apparatus. Thedequantizer 321 may perform dequantization on the quantized transformcoefficients by using a quantization parameter (ex. quantization stepsize information) and obtain transform coefficients.

The inverse transformer 322 inversely transforms the transformcoefficients to obtain a residual signal (residual block, residualsample array).

The predictor may perform prediction on the current block and generate apredicted block including prediction samples for the current block. Thepredictor may determine whether intra prediction or inter prediction isapplied to the current block based on the information on the predictionoutput from the entropy decoder 310 and may determine a specificintra/inter prediction mode.

The predictor 320 may generate a prediction signal based on variousprediction methods described below. For example, the predictor may notonly apply intra prediction or inter prediction to predict one block butalso simultaneously apply intra prediction and inter prediction. Thismay be called combined inter and intra prediction (CIIP). In addition,the predictor may be based on an intra block copy (IBC) prediction modeor a palette mode for prediction of a block. The IBC prediction mode orpalette mode may be used for content image/video coding of a game or thelike, for example, screen content coding (SCC). The IBC basicallyperforms prediction in the current picture but may be performedsimilarly to inter prediction in that a reference block is derived inthe current picture. That is, the IBC may use at least one of the interprediction techniques described in this document. The palette mode maybe considered as an example of intra coding or intra prediction. Whenthe palette mode is applied, a sample value within a picture may besignaled based on information on the palette table and the paletteindex.

The intra predictor 331 may predict the current block by referring tothe samples in the current picture. The referred samples may be locatedin the neighborhood of the current block or may be located apartaccording to the prediction mode. In the intra prediction, predictionmodes may include a plurality of non-directional modes and a pluralityof directional modes. The intra predictor 331 may determine theprediction mode applied to the current block by using a prediction modeapplied to a neighboring block.

The inter predictor 332 may derive a predicted block for the currentblock based on a reference block (reference sample array) specified by amotion vector on a reference picture. In this case, in order to reducethe amount of motion information transmitted in the inter predictionmode, motion information may be predicted in units of blocks, subblocks,or samples based on correlation of motion information between theneighboring block and the current block. The motion information mayinclude a motion vector and a reference picture index. The motioninformation may further include inter prediction direction (L0prediction, L1 prediction, Bi prediction, etc.) information. In the caseof inter prediction, the neighboring block may include a spatialneighboring block present in the current picture and a temporalneighboring block present in the reference picture. For example, theinter predictor 332 may configure a motion information candidate listbased on neighboring blocks and derive a motion vector of the currentblock and/or a reference picture index based on the received candidateselection information. Inter prediction may be performed based onvarious prediction modes, and the information on the prediction mayinclude information indicating a mode of inter prediction for thecurrent block.

The adder 340 may generate a reconstructed signal (reconstructedpicture, reconstructed block, reconstructed sample array) by adding theobtained residual signal to the prediction signal (predicted block,predicted sample array) output from the predictor (including the interpredictor 332 and/or the intra predictor 331). If there is no residualfor the block to be processed, such as when the skip mode is applied,the predicted block may be used as the reconstructed block.

The adder 340 may be called reconstructor or a reconstructed blockgenerator. The generated reconstructed signal may be used for intraprediction of a next block to be processed in the current picture, maybe output through filtering as described below, or may be used for interprediction of a next picture.

Meanwhile, luma mapping with chroma scaling (LMCS) may be applied in thepicture decoding process.

The filter 350 may improve subjective/objective image quality byapplying filtering to the reconstructed signal. For example, the filter350 may generate a modified reconstructed picture by applying variousfiltering methods to the reconstructed picture and store the modifiedreconstructed picture in the memory 360, specifically, a DPB of thememory 360. The various filtering methods may include, for example,deblocking filtering, a sample adaptive offset, an adaptive loop filter,a bilateral filter, and the like.

The (modified) reconstructed picture stored in the DPB of the memory 360may be used as a reference picture in the inter predictor 332. Thememory 360 may store the motion information of the block from which themotion information in the current picture is derived (or decoded) and/orthe motion information of the blocks in the picture that have alreadybeen reconstructed. The stored motion information may be transmitted tothe inter predictor 260 so as to be utilized as the motion informationof the spatial neighboring block or the motion information of thetemporal neighboring block. The memory 360 may store reconstructedsamples of reconstructed blocks in the current picture and transfer thereconstructed samples to the intra predictor 331.

In the present disclosure, the embodiments described in the filter 260,the inter predictor 221, and the intra predictor 222 of the encodingapparatus 200 may be the same as or respectively applied to correspondto the filter 350, the inter predictor 332, and the intra predictor 331of the decoding apparatus 300. The same may also apply to the interpredictor 332 and the intra predictor 331.

Meanwhile, with respect to inter prediction, an inter prediction methodwhich considers image distortion has been proposed. More specifically,affine motion model has been proposed, which efficiently derives motionvectors for sub-blocks or sample points of a current block and improvesaccuracy of inter prediction regardless of deformation due to imagerotation, zoom-in, or zoom-out. In other words, affine motion model hasbeen proposed, which derives motion vectors for sub-blocks or samplepoints of a current block. Prediction that employs the affine motionmodel may be referred to as affine inter prediction or affine motionprediction.

For example, the affine inter prediction using the affine motion modelmay efficiently express four motions, that is, four deformations, asdescribed below.

FIG. 4 illustrates a motion expressed through the affine motion model.Referring to FIG. 4, a motion that may be represented through the affinemotion model may include a translational motion, a scale motion, arotational motion, and a shear motion. That is, a scale motion in which(a portion of) image is scaled according to the passage of time, arotational motion in which (a portion of) image is rotated according tothe passage of time, and a shear motion in which (a portion of) image isparallelogrammically deformed according to the passage of time, as wellas the translational motion in which an (portion of) image is planarlymoved according to the passage of time illustrated in FIG. 4, may beeffectively represented as illustrated in FIG. 3.

The encoding apparatus/decoding apparatus may predict a distortion shapeof the image based on the motion vectors at control points (CPs) of thecurrent block through the affine inter prediction the compressionperformance of the image may be improved by increasing accuracy ofprediction. In addition, since a motion vector for at least one controlpoint of the current block may be derived using a motion vector of aneighboring block of the current block, a burden of a data amount onadditional information may be reduced and inter prediction efficiencymay be improved considerably.

As an example of the affine inter prediction, motion information atthree control points, that is, three reference points, may be required.

FIG. 5 illustrates the affine motion model in which motion vectors forthree control points are used.

When a top-left sample position in a current block 500 is (0, 0), samplepositions (0, 0), (w, 0), and (0, h) may be defined as the controlpoints as shown in FIG. 5. Hereinafter, the control point of the sampleposition (0, 0) may be represented as CP0, the control point of thesample position (w, 0) may be represented as CP1, and the control pointof the sample position (0, h) may be represented as CP2.

An equation for the affine motion model may be derived using the controlpoints and the motion vectors of the corresponding control pointsdescribed above. An equation for the affine motion model may beexpressed as follows.

$\begin{matrix}\left\{ \begin{matrix}{v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}*x} + {\frac{\left( {v_{2x} - v_{0x}} \right)}{h}*y} + v_{0x}}} \\{v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}*x} - {\frac{\left( {\nu_{2y} - \nu_{0y}} \right)}{h}*y} + v_{0y}}}\end{matrix} \right. & \left\lbrack {{Equation}\mspace{14mu} 1} \right\rbrack\end{matrix}$

Here, w denotes a width of the current block 500, h denotes a height ofthe current block 500, v_(0x) and v_(0y) denote an x component and ycomponent of the motion vector of CP0, respectively, v_(1x) and v_(1y)denote an x component and a y component of the motion vector of CP1,respectively, and v_(2x) and v_(2y) denote an x component and a ycomponent of the motion vector of CP2, respectively. In addition, xdenotes an x component of a position of a target sample in the currentblock 500, y denotes a y component of the position of the target samplein the current block 500, v_(x) denotes an x component of a motionvector of the target sample in the current block 500, and v_(y) denotesa y component of the motion vector of the target sample in the currentblock 500.

Since the motion vector of CP0, the motion vector of CP1, and the motionvector of CP2 are known, a motion vector based on the sample position inthe current block may be derived based on Equation 1. That is, accordingto the affine motion model, the motion vectors v0(v_(0x), v_(0y)),v1(v_(1x), v_(1y)), and v2(v_(2x), v_(2y)) at the control points may bescaled based on a distance ratio between the coordinates (x, y) of thetarget sample and the three control points to derive the motion vectorsof the target sample according to the position of the target sample.That is, according to the affine motion model, a motion vector of eachsample in the current block may be derived based on the motion vectorsof the control points. Meanwhile, a set of motion vectors of samples inthe current block derived according to the affine motion model may bereferred to as an affine motion vector field (MVF).

Meanwhile, six parameters for Equation 1 may be represented by a, b, c,d, e, and f as shown in Equation 1 below, and an equation for the affinemotion model represented by the six parameters may be as follows.

$\begin{matrix}{{a = \frac{\left( {\nu_{1x} - v_{0x}} \right)}{w}}{b = \frac{\left( {\nu_{2x} - v_{0x}} \right)}{h}}{c = v_{0x}}{d = \frac{\left( {\nu_{1y} - \nu_{0y}} \right)}{w}}{e = {- \frac{\left( {\nu_{2y} - \nu_{0y}} \right)}{h}}}{f = \nu_{0y}}\left\{ \begin{matrix}{v_{x} = {{a*x} + {b*y} + c}} \\{v_{y} = {{d*x} + {e*y} + f}}\end{matrix} \right.} & \left\lbrack {{Equation}\mspace{14mu} 2} \right\rbrack\end{matrix}$

Here, w denotes a width of the current block 500, h denotes a height ofthe current block 500, v_(0x) and v_(0y) denote the x component of themotion vector of CP0, y components, v_(1x) and v_(1y) represent an xcomponent and a y component of the motion vector of CP1, respectively,and v_(2x) and v_(2y) represent the x component and the y component ofthe motion vector of CP2, respectively. In addition, x denotes the xcomponent of the position of the target sample in the current block 500,y denotes the y component of the position of the target sample in thecurrent block 500, v_(x) denotes the x component of the motion vector ofthe target sample in the current block 500, v_(y) denotes the ycomponent of the motion vector of the target sample in the current block500.

The affine motion model or the affine inter prediction using the sixparameters may be referred to as a 6-parameter affine motion model orAF6.

In addition, as an example of the affine inter prediction, motioninformation at two control points, i.e., two reference points, may berequired.

FIG. 6 illustrates the affine motion model in which motion vectors fortwo control points are used. The affine motion model using two controlpoints may represent three motions including a translational motion, ascale motion, and a rotational motion. The affine motion modelrepresenting the three motions may be referred to as a similarity affinemotion model or a simplified affine motion model.

When a top-left sample position in a current block 600 is (0, 0), samplepositions (0, 0) and (w, 0) may be defined as the control points asshown in FIG. 6. Hereinafter, the control point of the sample position(0, 0) may be represented as CP0 and the control point of the sampleposition (w, 0) may be represented as CP1.

An equation for the affine motion model may be derived using the controlpoints and the motion vectors of the corresponding control pointsdescribed above. An equation for the affine motion model may beexpressed as follows.

$\begin{matrix}\left\{ \begin{matrix}{v_{x} = {{\frac{\left( {\nu_{1x} - v_{0x}} \right)}{w}*x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}*y} + v_{0x}}} \\{v_{y} = {{\frac{\left( {\nu_{1y} - \nu_{0y}} \right)}{w}*x} - {\frac{\left( {\nu_{1x} - v_{0x}} \right)}{w}*y} + \nu_{0y}}}\end{matrix} \right. & \left\lbrack {{Equation}\mspace{14mu} 3} \right\rbrack\end{matrix}$

Here, w denotes a width of the current block 600, v_(0x) and v_(0y)denote x and y components of the motion vector of CP0, respectively, andv_(1x) and v_(1y) denote x and y components of the motion vector of CP1.In addition, x denotes an x component of a position of a target samplein the current block 600, y denotes a y component of the position of thetarget sample in the current block 600, v_(x) denotes an x component ofthe motion vector of the target sample in the current block 600, andv_(y) denotes a y component of the motion vector of the target sample inthe current block 600.

Meanwhile, four parameters of Equation 3 may be represented by a, b, c,and d as in the following Equation, and an equation for the affinemotion model represented by the four parameters may be as follows.

$\begin{matrix}{{a = \frac{\left( {v_{1x} - v_{0x}} \right)}{w}}{b = \frac{\left( {v_{1y} - v_{0y}} \right)}{w}}{c = v_{0x}}{d = v_{0y}}\left\{ \begin{matrix}{v_{x} = {{a*x} - {b*y} + c}} \\{v_{y} = {{b*x} + {a*y} + d}}\end{matrix} \right.} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack\end{matrix}$

Here, w denotes a width of the current block 600, v_(0x) and v_(0y)denote x and y components of the motion vector of CP0, respectively, andv_(1x) and v_(1y) denote x and y components of the motion vector of CP1,respectively. In addition, x denotes an x component of a position of atarget sample in the current block 600, y denotes a y component of theposition of the target sample in the current block 600, v_(x) denotes anx component of the motion vector of the target sample in the currentblock 600 and v_(y) denotes a y component of the motion vector of thetarget sample in the current block 600. The affine motion model usingthe two control points may be represented by four parameters a, b, c,and d as shown in Equation 4, and thus, the affine motion model usingthe four parameters or the affine inter prediction may be referred to asa 4-parameter affine motion model or AF4. That is, according to theaffine motion model, a motion vector of each sample in the current blockmay be derived based on the motion vectors of the control points.Meanwhile, a set of motion vectors of the samples in the current blockderived according to the affine motion model may be referred to as anaffine motion vector field (MVF).

Meanwhile, as described above, a motion vector of a sample unit may bederived through the affine motion model, and thus accuracy of interprediction may be significantly improved. In this case, however,complexity in the motion compensation process may be significantlyincreased.

Accordingly, it may be limited such that a motion vector of a sub blockunit of the current block, instead of deriving a motion vector of thesample unit, is derived.

FIG. 7 illustrates a method of deriving a motion vector on a sub-blockbasis based on the affine motion model. FIG. 7 illustrates a case wherea size of the current block is 16×16 and a motion vector is derived inunits of 4×4 subblocks. The sub block may be set to various sizes. Forexample, when the sub block is set to n×n size (n is a positive integer,e.g., n is 4), a motion vector may be derived in units of n×n sub blocksin the current block based on the affine motion model and variousmethods for deriving a motion vector representing each subblock may beapplied.

For example, referring to FIG. 7, a motion vector of each subblock maybe derived using the center or bottom right side sample position of eachsubblock as a representative coordinate. Here, the center bottom rightposition may indicate a sample position positioned on the bottom rightside among four samples positioned at the center of the sub block. Forexample, when n is an odd number, one sample may be positioned at thecenter of the sub block, and in this case, the center sample positionmay be used for deriving the motion vector of the sub block. However,when n is an even number, four samples may be positioned to be adjacentat the center of the subblock, and in this case, the bottom right sampleposition may be used to derive a motion vector. For example, referringto FIG. 7, representative coordinates of each subblock may be derived as(2, 2), (6, 2), (10, 2), . . . , (14, 14), and encodingapparatus/decoding apparatus may derive the motion vector of eachsubblock by substituting each of the representative coordinates of thesubblocks into Equation 1 or 3 described above. The motion vectors ofthe subblocks in the current block derived through the affine motionmodel may be referred to as affine MVF.

Meanwhile, as an example, the size of the sub block in the current blockmay be derived based on the following equation.

$\begin{matrix}\left\{ \begin{matrix}{M = {{clip}\; 3\left( {4,w,\frac{w*{MvPre}}{\begin{matrix}{\max\left( {{{abs}\left( {v_{1x} - v_{0x}} \right)},} \right.} \\\left. {{abs}\left( {v_{1y} - v_{0y}} \right)} \right)\end{matrix}}} \right)}} \\{N = {{clip}\; 3\left( {4,h,\frac{h*{MvPre}}{\begin{matrix}{\max\left( {{{abs}\left( {v_{2x} - v_{0x}} \right)},} \right.} \\\left. {{abs}\left( {v_{2y} - v_{0y}} \right)} \right)\end{matrix}}} \right)}}\end{matrix} \right. & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack\end{matrix}$

Here, M denotes a width of the sub block, and N denotes a height of thesub block. In addition, v_(0x) and v_(0y) denote an x component and a ycomponent of CPMV0 of the current block, v_(1x) and v_(1y) denote an xcomponent and a y component of CPMV1 of the current block, w denotes awidth of the current block, h denotes a height of the current block, andMvPre denotes a motion vector fraction accuracy. For example, the motionvector fraction accuracy may be set to 1/16.

Meanwhile, in the inter prediction using the above-described affinemotion model, that is, the affine motion prediction, may have an affinemerge mode AF_MERGE and an affine inter mode AF_INTER. Here, the affineinter mode may be referred to as an affine MVP mode AF_MVP.

The affine merge mode is similar to an existing merge mode in that MVDfor the motion vector of the control points is not transmitted. That is,similarly to the existing skip/merge mode, the affine merge mode mayrefer to an encoding/decoding method of performing prediction byderiving a CPMV for each of two or three control points from aneighboring block of the current block.

For example, when the AF_MRG mode is applied to the current block,motion vectors of CP0 and CP1 (namely, CPMV0 and CPMV1) may be derivedfrom neighboring blocks to which affine mode has been applied amongneighboring blocks of the current block. In other words, CPMV0 and CPMV1of the neighboring blocks to which the affine mode has been applied maybe derived as merge candidates or may be derived as CPMV0 and CPMV1 forthe current block based on the merge candidates. Affine motion model maybe derived based on CPMV0 and CPMV1 of neighboring blocks represented bythe merge candidates, and based on the affine motion model, the CPMV0and the CPMV1 for the current block may be derived.

The affine inter mode may represent inter prediction which derivesMotion Vector Predictors (MVPs) for motion vectors of the controlpoints, motion vectors of the control points based on received motionvector differences (MVDs) and the MVPs, and the affine MVF of thecurrent block based on the motion vectors of the control points; andperforms prediction based on the affine MVF. Here, the motion vector ofthe control point may be termed Control Point Motion Vector (CPMV), MVPof the control point may be termed Control Point Motion Vector Predictor(CPMVP), and MVD of the control point may be termed Control Point MotionVector Difference (CPMVD). More specifically, for example, the encodingapparatus may derive Control Point Motion Vector Predictor (CPMVP) andControl Point Motion Vector (CPMV) for CP0 and CP1 (or CP0, CP1 andCP2), respectively and transmit or store information on the CPMVP and/orCPMVD which represents a difference between the CPMVP and the CPMV.

Here, if the affine inter mode is applied to the current block, theencoding/decoding apparatus may construct an affine MVP candidate listbased on neighboring blocks of the current block, where the affine MVPcandidate may be referred to as CPMVP pair candidate, and the affine MVPcandidate list may be referred to as CPMVP candidate list.

Also, each affine MVP candidate may represent a combination of CPMVPs ofCP0 and CP1 in the four-parameter affine motion model and a combinationof CPMVPs of CP0, CP1, and CP2 in the six-parameter affine motion model.

FIG. 8 is a flowchart illustrating an affine motion prediction methodaccording to an embodiment of the present disclosure.

Referring to FIG. 8, the affine motion prediction method may be largelydescribed as follows. Once the affine motion prediction method isstarted, a CPMV pair is first obtained S800. Here, if four-parameteraffine model is used, the CPMV pair may include CPMV0 and CPMV1.

Afterwards, affine motion compensation may be performed based on theCPMV pair S810, after which affine motion prediction may be terminated.

Also, two affine prediction modes may be defined to determine the CPMV0and the CPMV1. Here, the two affine prediction modes may include affineinter mode and affine merge mode. Affine inter mode may signalinformation on the Motion Vector Difference (MVD) between two motionvectors of CPMV0 and CPMV1 to determine the CPMV0 and the CPMV1 clearly.On the other hand, affine merge mode may derive a CPMV pair withoutsignaling MVD information.

In other words, affine merge mode may derive CPMVs of a current block byusing CPMVs of neighboring blocks coded in the affine mode, and ifmotion vectors are determined by the sub-block unit, affine merge modemay be referred to as sub-block merge mode.

In the affine merge mode, the encoding apparatus may signal, to thedecoding apparatus, indexes of neighboring blocks coded in the affinemode for deriving CPMVs of the current block and may further signal thedifference values among CPMVs of neighboring blocks and CPMVs of thecurrent block. Here, the affine merge mode may construct an affine mergecandidate list based on neighboring blocks, where indexes of theneighboring blocks may indicate the neighboring blocks to be utilizedwithin the affine merge candidate list to derive the CPMVs of thecurrent block. The affine merge candidate list may also be referred toas the sub-block merge candidate list.

The affine inter mode may also be referred to as the affine MVP mode. Inthe affine MVP mode, the CPMVs of a current block may be derived basedon Control Point Motion Vector Predictor (CPMVP) and Control PointMotion Vector Difference (CPMVD). In other words, the encoding apparatusmay determine CPMVPs for the CPMVs of a current block, derive the CPMVD,which is a difference value between the CPMV and the CPMVP of thecurrent block, and signal information on the CPMVP and information onthe CPMVD to the decoding apparatus. Here, the affine MVP mode mayconstruct an affine MVP candidate list based on neighboring blocks, andinformation on the CPMVPs may indicate neighboring blocks to be utilizedfor deriving the CPMVPs for the CPMVs of the current block from theaffine MVP candidate list. The affine MVP candidate list may also bereferred to as the control point motion vector predictor candidate list.

For example, when affine inter mode of the six-parameter affine motionmodel is applied, the current block may be encoded as described below.

FIG. 9 illustrates a method for deriving a motion vector predictor at acontrol point according to one embodiment of the present disclosure.

Referring to FIG. 9, the motion vector of CP0 of the current block maybe denoted by v₀, motion vector of CP1 by v₁, motion vector of a controlpoint at the bottom-left sample position by v₂, and motion vector of CP2by v₃. In other words, the v₀ may represent the CPMVP of CP0, the v₁ theCPMVP of CP1, and the v₂ the CPMVP of CP2.

An affine MVP candidate may be a combination of the CPMVP candidate ofthe CP0, CPMVP candidate of the CP1, and CPMVP candidate of the CP2.

For example, the affine MVP candidate may be derived as follows.

More specifically, a maximum of 12 CPMVP candidate combinations may bedetermined as shown in the equation below.{(v ₀ ,v ₁ ,v ₂)|v ₀ ={v _(A) ,v _(B) ,v _(C) },v ₁ ={v _(D) ,v _(E) },v₂ ={v _(F) ,v _(G)}}  [Equation 6]

Here, v_(A) represents the motion vector of neighboring block A, v_(B)the motion vector of neighboring block B, v_(C) the motion vector ofneighboring block C, v_(D) the motion vector of neighboring block D,v_(E) the motion vector of neighboring block E, v_(F) the motion vectorof neighboring block F, and v_(G) the motion vector of neighboring blockG.

Additionally, the neighboring block A may represent a neighboring blockpositioned at the top-left of a top-left sample position of the currentblock, the neighboring block B may represent a neighboring blockpositioned at the top of the top-left sample position of the currentblock, and the neighboring block C may represent a neighboring blockpositioned at a left-side of the top-left sample position of the currentblock. Additionally, the neighboring block D may represent a neighboringblock positioned at the top of a top-right sample position of thecurrent block, and the neighboring block E may represent a neighboringblock positioned at the top-right of the top-right sample position ofthe current block. And, the neighboring block F may represent aneighboring block positioned at a left-side of a bottom-left sampleposition of the current block, and the neighboring block G may representa neighboring block positioned at the bottom-left of the bottom-leftsample position of the current block.

In other words, referring to Eq. 6 above, the CPMVP candidate of CP0 mayinclude the motion vector v_(A) of the neighboring block A, motionvector v_(B) of the neighboring block B and/or motion vector v_(C) ofthe neighboring block C; the CPMVP candidate of CP1 may include themotion vector v_(D) of the neighboring block D and/or motion vectorv_(E) of the neighboring block E; the CPMVP candidate of CP2 may includethe motion vector v_(F) of the neighboring block F and/or motion vectorv_(G) of the neighboring block G.

In other words, the CPMVP v₀ of CP0 may be derived based on at least onemotion vector for the neighboring blocks A, B, and C with respect to thetop-left sample position. Herein, neighboring block A may represent ablock being positioned at a top-left of a top-left sample position ofthe current block, neighboring block B may represent a block beingpositioned at a top of the top-left sample position of the currentblock, and neighboring block C may represent a block being positioned ata left-side of the top-left sample position of the current block.

Based on the motion vectors of the neighboring blocks, a maximum of 12CPMVP candidate combinations including the CPMVP candidate of the CP0,CPMVP candidate of the CP1, and CPMVP candidate of the CP2 may bederived.

Afterwards, derived CPMVP candidate combinations are arranged in theascending order of DV, and two top CPMVP candidate combinations may bederived as the affine MVP candidates.

DV of a CPMVP candidate combination may be derived by the followingequation.DV=|v _(1x) −v _(0x))h−(v2_(y) −v0_(y))*w|+|v1_(y) −v0_(y))*h+(v2_(x)−v0_(x))*w|  [Equation 7]

Afterwards, the encoding apparatus may determine CPMVs for therespective affine MVP candidates, compare the Rate Distortion (RD) costamong the CPMVs, and select the affine MVP candidate having the smallestRD cost as the optimal affine MVP candidate for the current block. Theencoding apparatus may encode and signal the index and CPMVD indicatingthe optimal candidate.

Also, for example, if affine merge mode is applied, the current blockmay be encoded as described below.

FIG. 10 illustrates a method for deriving a motion vector predictor at acontrol point according to one embodiment of the present disclosure.

Based on neighboring blocks of a current block shown in FIG. 10, anaffine merge candidate list of the current block may be constructed. Theneighboring blocks may include neighboring block A, neighboring block B,neighboring block C, neighboring block D, and neighboring block E. Theneighboring block A may represent a left neighboring block of thecurrent block, the neighboring block B a top neighboring block of thecurrent block, the neighboring block C a top-right corner neighboringblock of the current block, the neighboring block D a bottom-left cornerneighboring block of the current block, the neighboring block E atop-left corner neighboring block of the current block.

For example, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, the left neighboring block may be the block including asample at the coordinates of (−1, H−1), the top neighboring block may bethe block including a sample at the coordinates of (W−1, −1), thetop-right corner neighboring block may be the block including a sampleat the coordinates of (W, −1), the bottom-left corner neighboring blockmay be the block including a sample at the coordinates of (−1, H), andthe top-left corner neighboring block may by the block including asample at the coordinates of (−1, −1).

More specifically, for example, the encoding apparatus may scan theneighboring block A, neighboring block B, neighboring block C,neighboring block D, and neighboring block E of the current block in aspecific scanning order; and determine the neighboring block firstencoded in the affine prediction mode according to the scanning order asa candidate block of the affine merge mode, namely, affine mergecandidate. In other words, the specific scanning order may be performedin the order of neighboring block A, neighboring block B, neighboringblock C, neighboring block D, and neighboring block E.

Afterwards, the encoding apparatus may determine affine motion model ofthe current block by using CPMVs of the determined candidate block,determine CPMVs of the current block based on the affine motion model,and determine affine MVF of the current block based on the CPMVs.

As one example, if neighboring block A is determined as a candidateblock of the current block, coding may be performed as described below.

FIG. 11 illustrates one example of affine prediction performed whenneighboring block A is selected as an affine merge candidate.

Referring to FIG. 11, the encoding apparatus may determine neighboringblock A of the current block as a candidate block and derive affinemotion model of the current block based on CPMVs of the neighboringblock, v₂ and v₃. Afterwards, the encoding apparatus may determine CPMVsof the current block, v₀ and v₁, based on the affine motion model. Theencoding apparatus may determine affine MVF based on the CPMVs of thecurrent block, v₀ and v₁, and perform the process for encoding thecurrent block based on the affine MVF.

Meanwhile, related to affine inter prediction, as a means to constructan affine MVP candidate list, inherited affine candidate and constructedaffine candidate are being considered.

Here, the inherited affine candidate may be described as follows.

For example, if a neighboring block of the current block is an affineblock, and a reference picture of the current block is the same as areference picture of the neighboring block, an affine MVP pair of thecurrent block may be determined from affine motion model of theneighboring block. Here, the affine block may represent a block to whichthe affine inter prediction has been applied. The inherited affinecandidate may represent CPMVPs (for example, the affine MVP pair)derived based on affine motion model of the neighboring block.

More specifically, as one example, the inherited affine candidate may bederived as described below.

FIG. 12 illustrates neighboring blocks for deriving the inherited affinecandidate.

Referring to FIG. 12, neighboring blocks of the current block mayinclude left neighboring block A0 of the current block, bottom-leftcorner neighboring block A1 of the current block, top neighboring blockB0 of the current block, top-right corner neighboring block B1 of thecurrent block, and top-left corner neighboring block B2 of the currentblock.

For example, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, the left neighboring block may be the block including asample at the coordinates of (−1, H−1), the top neighboring block may bethe block including a sample at the coordinates of (W−1, −1), thetop-right corner neighboring block may be the block including a sampleat the coordinates of (W, −1), the bottom-left corner neighboring blockmay be the block including a sample at the coordinates of (−1, H), andthe top-left corner neighboring block may by the block including asample at the coordinates of (−1, −1).

The encoding/decoding apparatus may check neighboring blocks A0, A1, B0,B1, and B2 sequentially, and if a neighboring block is coded accordingto affine motion model and a reference picture of the current block isthe same as a reference picture of the neighboring block, two CPMVs orthree CPMVs of the current block may be derived based on the affinemotion model of the neighboring block. The CPMVs may be derived as anaffine MVP candidate of the current block. The affine MVP candidate mayrepresent the inherited affine candidate.

As one example, up to two inherited affine candidates may be derivedbased on the neighboring blocks.

For example, the encoding/decoding apparatus may derive a first affineMVP candidate of the current block based on a first block amongneighboring blocks. Here, the first block may be coded according toaffine motion model, and a reference picture of the first block may bethe same as the reference picture of the current block. In other words,the first block may be a block first confirmed to satisfy a conditionfrom checking of the neighboring blocks according to a specific order.The condition may be coded according to affine motion model, and thereference picture of the block may be the same as the reference pictureof the current block.

Afterwards, the encoding/decoding apparatus may derive a second affineMVP candidate based on a second block among neighboring blocks. Here,the second block may be coded according to affine motion model, and areference picture of the second block may be the same as the referencepicture of the current block. In other words, the second block may be ablock second confirmed to satisfy the condition from checking of theneighboring blocks according to a specific order. The condition may becoded according to affine motion model, and the reference picture of theblock may be the same as the reference picture of the current block.

Meanwhile, for example, when the number of the inherited affinecandidates available is less than 2 (namely, when the number ofinherited affine candidates derived is less than 2), a constructedaffine candidate may be considered. The constructed affine candidate maybe derived as follows.

FIG. 13 illustrates spatial candidates for the constructed affinecandidate.

As shown in FIG. 13, motion vectors of neighboring blocks of the currentblock may be divided into three groups. Referring to FIG. 13, theneighboring blocks may include neighboring block A, neighboring block B,neighboring block C, neighboring block D, neighboring block E,neighboring block F, and neighboring block G.

The neighboring block A may represent a neighboring block located topleft of a top-left sample position of the current block; the neighboringblock B, a neighboring block located top of the top-left sample positionof the current block; and the neighboring block C, a neighboring blocklocated left of the top-left sample position of the current block. Inaddition, the neighboring block D may represent a neighboring blocklocated top of a top-right sample position of the current block, and theneighboring block E may represent a neighboring block located top rightof the top-right sample position of the current block. In addition, theneighboring block F may represent a neighboring block located left of abottom-left sample position of the current block; and the neighboringblock G may represent a neighboring block located bottom left of thebottom-left sample position of the current block.

For example, the three groups may include S₀, S₁, and S₂, where the S₀,S₁, and S₂ may be derived as shown in the table below.

TABLE 1 S₀ = {mv_(A), mv_(B), mv_(C)} S₁ = {mv_(D), mv_(E)} S₂ ={mv_(F), mv_(G)}

Here, mv_(A) represents the motion vector of the neighboring block A,mv_(B) the motion vector of the neighboring block B, mv_(C) the motionvector of the neighboring block C, mv_(B) the motion vector of theneighboring block D, mv_(E) the motion vector of the neighboring blockE, mv_(F) the motion vector of the neighboring block F, and mv_(G) themotion vector of the neighboring block G. The S₀ may indicate a firstgroup, S₁ may indicate a second group, and S₂ may indicate a thirdgroup.

The encoding/decoding apparatus may derive mv₀ from S₀, mv₁ from S₁, mv₂from S₂, and an affine MVP candidate including mv₀, mv₁, and mv₂. Theaffine MVP candidate may indicate the constructed affine candidate.Also, mv₀ may be the CPMVP candidate of CP0, mv₁ may be the CPMVPcandidate of CP1, and mv₂ may be the CPMVP candidate of CP2.

Here, the reference picture for mv₀ may be the same as the referencepicture of the current block. In other words, mv₀ may be the motionvector first confirmed to satisfy a condition from checking of themotion vectors within S₀. The condition may be such that a referencepicture for a motion vector is the same as the reference picture of thecurrent block. The specific order may be such that motion vectors arechecked within S₀ in the order of neighboring block A, neighboring blockB, and neighboring block C. Also, the order of checking may be performeddifferently from that described above and may not be limited to theexample above.

Also, the reference picture for mv₁ may be the same as the referencepicture of the current block. In other words, mv₁ may be the motionvector first confirmed to satisfy a condition from checking of themotion vectors within S₁. The condition may be such that a referencepicture for a motion vector is the same as the reference picture of thecurrent block. The specific order may be such that motion vectors arechecked within S₁ in the order of neighboring block D and neighboringblock E. Also, the order of checking may be performed differently fromthat described above and may not be limited to the example above.

Also, the reference picture for mv₂ may be the same as the referencepicture of the current block. In other words, mv₂ may be the motionvector first confirmed to satisfy a condition from checking of themotion vectors within S₂. The condition may be such that a referencepicture for a motion vector is the same as the reference picture of thecurrent block. The specific order may be such that motion vectors arechecked within S₂ in the order of neighboring block F and neighboringblock G. Also, the order of checking may be performed differently fromthat described above and may not be limited to the example above.

Meanwhile, when only mv₀ and mv₁ are available, namely, when only mv₀and mv₁ are derived, mv₂ may be derived by the following equation.

$\begin{matrix}{{{\overset{\_}{mv}}_{2}^{x} = {{\overset{\_}{mv}}_{0}^{x} - {h\frac{\left( {{\overset{\_}{mv}}_{1}^{y} - {\overset{\_}{mv}}_{0}^{y}} \right)}{w}}}},{{\overset{\_}{mv}}_{2}^{y} = {{\overset{\_}{mv}}_{0}^{y} + {h\frac{\left( {{\overset{\_}{mv}}_{1}^{x} - {\overset{\_}{mv}}_{0}^{x}} \right)}{w}}}}} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack\end{matrix}$

Here, mv ₂ ^(x) represents x component of mv₂, mv ₂ ^(y) represents ycomponent of mv₂, mv ₀ ^(x) represents x component of mv₀, mv ₀ ^(y)represents y component of mv₀, mv ₁ ^(x) represents x component of mv₁,and mv ₁ ^(y) represents y component of mv₁. Also, w represents width ofthe current block, and h represents height of the current block.

Meanwhile, when only mv₀ and mv₂ are derived, mv₁ may be derived by thefollowing equation.

$\begin{matrix}{{{\overset{\_}{mv}}_{1}^{x} = {{\overset{\_}{mv}}_{0}^{x} + {h\frac{\left( {{\overset{\_}{mv}}_{2}^{y} - {\overset{\_}{mv}}_{0}^{y}} \right)}{w}}}},{{\overset{\_}{mv}}_{1}^{y} = {{\overset{\_}{mv}}_{0}^{y} - {h\frac{\left( {{\overset{\_}{mv}}_{2}^{x} - {\overset{\_}{mv}}_{0}^{x}} \right)}{w}}}}} & \left\lbrack {{Equation}\mspace{14mu} 9} \right\rbrack\end{matrix}$

Here, mv ₁ ^(x) represents x component of mv₁, mv₁ ^(y) represents ycomponent of mv₁, mv ₀ ^(x) represents x component of mv₀, mv ₀ ^(y)represents y component of mv₀, mv ₂ ^(x) represents x component of mv₂,and mv ₂ ^(y) represents y component of mv₂. Also, w represents width ofthe current block, and h represents height of the current block.

Also, when the number of the inherited affined candidates availableand/or the number of the constructed affined candidates is less than 2,the AMVP process of the existing HEVC standard may be applied forconstruction of the affine MVP list. In other words, when the number ofthe inherited affined candidates available and/or the number of theconstructed affined candidates is less than 2, the process forconstructing MVP candidates specified in the existing HEVC standard maybe performed.

Meanwhile, flow diagrams of embodiments for constructing the affine MVPlist may be described as follows.

FIG. 14 illustrates one example of constructing an affine MVP list.

Referring to FIG. 14, the encoding/decoding apparatus may add aninherited candidate to the affine MVP list of a current block S1400. Theinherited candidate may represent the inherited affine candidatedescribed above.

More specifically, the encoding/decoding apparatus may derive up to twoinherited affine candidates from neighboring blocks of the current blockS1405. Here, the neighboring blocks may include left neighboring blockA0 of the current block, bottom-left corner neighboring block A1 of thecurrent block, top neighboring block B0 of the current block, top-rightcorner neighboring block B1 of the current block, and top-left cornerneighboring block B2 of the current block.

For example, the encoding/decoding apparatus may derive a first affineMVP candidate of the current block based on a first block among theneighboring blocks. Here, the first block may be coded according toaffine motion model, and the reference picture of the first block may bethe same as the reference picture of the current block. In other words,the first block may be the block first confirmed to satisfy a conditionfrom checking of the neighboring blocks according to a specific order.The condition may be coded according to affine motion model, and thereference picture of the block may be the same as the reference pictureof the current block.

Afterwards, the encoding/decoding apparatus may derive a second affineMVP candidate based on a second block among neighboring blocks. Here,the second block may be coded according to affine motion model, and areference picture of the second block may be the same as the referencepicture of the current block. In other words, the second block may bethe block satisfying a condition second confirmed from checking of theneighboring blocks according to a specific order. The condition may becoded according to affine motion model, and the reference picture of theblock may be the same as the reference picture of the current block.

Meanwhile, the specific order may be such that the neighboring blocksare checked in the order of left neighboring block A0, bottom-leftcorner neighboring block A1, top neighboring block B0, top-right cornerneighboring block B1, and top-left corner neighboring block B2. Also,the order of checking may be performed differently from that describedabove and may not be limited to the example above.

The encoding/decoding apparatus may add a constructed candidate to theaffine MVP list of the current block S1410. The constructed candidatemay represent the constructed affine candidate above. The constructedcandidate may also be termed a constructed affine MVP candidate. If thenumber of inherited candidates available is less than 2, theencoding/decoding apparatus may add the constructed candidate to theaffine MVP list of the current block. For example, the encoding/decodingapparatus may derive one constructed affine candidate.

Meanwhile, the method for deriving a constructed affine candidate may bedifferent depending on whether affine motion model applied to thecurrent block is six-parameter affine motion model or four-parameteraffine motion model. Detailed descriptions about how the constructedcandidate is derived will be provided later.

The encoding/decoding apparatus may add an HEVC AMVP candidate to theaffine MVP list of the current block S1420. If the number of inheritedcandidates available and/or the number of constructed candidates is lessthan 2, the encoding/decoding apparatus may add an HEVC AMVP candidateto the affine MVP list of the current block. In other words, when thenumber of inherited candidates available and/or the number ofconstructed candidates is less than 2, the encoding/decoding apparatusmay perform the process for constructing an MVP candidate as specifiedin the existing HEVC standard.

Meanwhile, a method for deriving the constructed candidate may beperformed as follows.

For example, if affine motion model applied to the current block issix-parameter affine motion model, the constructed candidate may bederived as illustrated in the embodiment of FIG. 15.

FIG. 15 illustrates one example of deriving the constructed candidate.

Referring to FIG. 15, the encoding/decoding apparatus may check mv₀,mv₁, and mv₂ for the current block S1500. In other words, theencoding/decoding apparatus may determine whether mv₀, mv₁, and mv₂ areavailable among neighboring blocks of the current block. Here, mv₀ mayrepresent CPMVP candidate of CP0 of the current block, mv₁ may representCPMVP candidate of CP1 of the current block, and mv₂ may represent CPMVPcandidate of CP2 of the current block. Also, mv₀, mv₁, and mv₂ mayrepresent candidate motion vectors for the respective CPs.

For example, the encoding/decoding apparatus may check whether motionvectors of neighboring blocks within a first group satisfy a specificcondition according to a specific order. The encoding/decoding apparatusmay derive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₀. In otherwords, mv₀ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the firstgroup according to a specific order. If motion vectors of theneighboring blocks within the first group do not satisfy the specificcondition, available mv₀ may not exist. Here, for example, the specificorder may be performed in order of neighboring block A within the firstgroup, neighboring block B, and neighboring block C. Also, for example,the specific condition may be such that the reference picture for amotion vector of a neighboring block is the same as the referencepicture of the current block.

Also, for example, the encoding/decoding apparatus may check whethermotion vectors of neighboring blocks within a second group satisfy aspecific condition according to a specific order. The encoding/decodingapparatus may derive the motion vector of a neighboring block firstconfirmed to satisfy the condition during the checking process as mv₁.In other words, mv₁ may be the motion vector first confirmed to satisfythe specific condition from checking of motion vectors within the secondgroup according to a specific order. If motion vectors of theneighboring blocks within the second group do not satisfy the specificcondition, available mv₁ may not exist. Here, for example, the specificorder may be performed from neighboring block D within the second groupto neighboring block E. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

Also, for example, the encoding/decoding apparatus may check whethermotion vectors of neighboring blocks within a third group satisfy aspecific condition according to a specific order. The encoding/decodingapparatus may derive the motion vector of a neighboring block firstconfirmed to satisfy the condition during the checking process as mv₂ Inother words, mv₂ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the thirdgroup according to a specific order. If motion vectors of theneighboring blocks within the third group do not satisfy the specificcondition, available mv₂ may not exist. Here, for example, the specificorder may be performed from neighboring block F within the third groupto neighboring block G. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

Meanwhile, the first group may include a motion vector of theneighboring block A, a motion vector of the neighboring block B, and amotion vector of the neighboring block C; the second group, a motionvector of the neighboring block D, and a motion vector of theneighboring block E; and the third group, a motion vector of theneighboring block F, and a motion vector of the neighboring block G. Theneighboring block A may represent a neighboring block located top leftof a top-left sample position of the current block; the neighboringblock B, a neighboring block located top of the top-left sample positionof the current block; the neighboring block C, a neighboring blocklocated left of the top-left sample position of the current block; theneighboring block D, a neighboring block located top of a top-rightsample position of the current block; the neighboring block E, aneighboring block located top right of the top-right sample position ofthe current block; the neighboring block F, a neighboring block locatedleft of the bottom-left sample position of the current block; and theneighboring block G, a neighboring block located bottom left of thebottom-left sample position of the current block.

When only mv₀ and mv₁ are available for the current block, namely, whenonly mv₀ and mv₁ for the current block are derived, theencoding/decoding apparatus may derive mv₂ for the current block basedon Eq. 8 above S1510. The encoding/decoding apparatus may derive mv₂ byinserting the derived mv₀ and mv₁ into Eq. 8 above.

When only mv₀ and mv₂ are available for the current block, namely, whenonly mv₀ and mv₂ for the current block are derived, theencoding/decoding apparatus may derive mv₁ for the current block basedon Eq. 9 above S1520. The encoding/decoding apparatus may derive mv₁ byinserting the derived mv₀ and mv₂ into Eq. 9 above.

The encoding/decoding apparatus may provide the derived mv₀, mv₁ and mv₂as constructed candidates of the current block S1530. When mv₀, mv₁ andmv₂ are available, namely, when mv₀, mv₁ and mv₂ are derived based onneighboring blocks of the current block, the encoding/decoding apparatusmay provide the derived mv₀, mv₁ and mv₂ as constructed candidates ofthe current block.

Also, when only mv₀ and mv₁ are available for the current block, namely,when only mv₀ and mv₁ for the current block are derived, theencoding/decoding apparatus may provide the derived mv₀, mv₁, and mv₂derived based on Eq. 8 above as the constructed candidates of thecurrent block.

Also, when only mv₀ and mv₂ are available for the current block, namely,when only mv₀ and mv₂ for the current block are derived, theencoding/decoding apparatus may provide the derived mv₀, mv₂, and mv₁derived based on Eq. 9 above as the constructed candidates of thecurrent block.

Also, for example, if affine motion model applied to the current blockis four-parameter affine motion model, the constructed candidate may bederived as illustrated in the embodiment of FIG. 15.

FIG. 16 illustrates one example of deriving the constructed candidate.

Referring to FIG. 16, the encoding/decoding apparatus may check mv₀,mv₁, and mv₂ S1600. In other words, the encoding/decoding apparatus maydetermine whether mv₀, mv₁, and mv₂ are available among neighboringblocks of the current block. Here, mv₀ may represent CPMVP candidate ofCP₀ of the current block, mv₁ may represent CPMVP candidate of CP₁ ofthe current block, and mv₂ may represent CPMVP candidate of CP₂ of thecurrent block.

For example, the encoding/decoding apparatus may check whether motionvectors of neighboring blocks within a first group satisfy a specificcondition according to a specific order. The encoding/decoding apparatusmay derive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₀. In otherwords, mv₀ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the firstgroup according to a specific order. If motion vectors of theneighboring blocks within the first group do not satisfy the specificcondition, available mv₀ may not exist. Here, for example, the specificorder may be performed in order of neighboring block A within the firstgroup, neighboring block B, and neighboring block C. Also, for example,the specific condition may be such that the reference picture for amotion vector of a neighboring block is the same as the referencepicture of the current block.

Also, for example, the encoding/decoding apparatus may check whethermotion vectors of neighboring blocks within a second group satisfy aspecific condition according to a specific order. The encoding/decodingapparatus may derive the motion vector of a neighboring block firstconfirmed to satisfy the condition during the checking process as mv₁.In other words, mv₁ may be the motion vector first confirmed to satisfythe specific condition from checking of motion vectors within the secondgroup according to a specific order. If motion vectors of theneighboring blocks within the second group do not satisfy the specificcondition, available mv₁ may not exist. Here, for example, the specificorder may be performed from neighboring block D within the second groupto neighboring block E. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

Also, for example, the encoding/decoding apparatus may check whethermotion vectors of neighboring blocks within a third group satisfy aspecific condition according to a specific order. The encoding/decodingapparatus may derive the motion vector of a neighboring block firstconfirmed to satisfy the condition during the checking process as mv₂ Inother words, mv₂ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the thirdgroup according to a specific order. If motion vectors of theneighboring blocks within the third group do not satisfy the specificcondition, available mv₂ may not exist. Here, for example, the specificorder may be performed from neighboring block F within the third groupto neighboring block G. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

Meanwhile, the first group may include a motion vector of theneighboring block A, a motion vector of the neighboring block B, and amotion vector of the neighboring block C; the second group, a motionvector of the neighboring block D, and a motion vector of theneighboring block E; and the third group, a motion vector of theneighboring block F, and a motion vector of the neighboring block G. Theneighboring block A may represent a neighboring block located top leftof a top-left sample position of the current block; the neighboringblock B, a neighboring block located top of the top-left sample positionof the current block; the neighboring block C, a neighboring blocklocated left of the top-left sample position of the current block; theneighboring block D, a neighboring block located top of a top-rightsample position of the current block; the neighboring block E, aneighboring block located top right of the top-right sample position ofthe current block; the neighboring block F, a neighboring block locatedleft of the bottom-left sample position of the current block; and theneighboring block G, a neighboring block located bottom left of thebottom-left sample position of the current block.

When only mv₀ and mv₁ are available for the current block or when mv₀,mv₁, and mv₂ are available for the current block, namely, when only mv₀and mv₁ are derived for the current block or when mv₀, mv₁, and mv₂ arederived for the current block, the encoding/decoding apparatus mayprovide the derived mv₀ and mv₁ as constructed candidates of the currentblock S1610.

Meanwhile, when only mv₀ and mv₂ are available for the current block,namely, when only mv₀ and mv₂ are derived for the current block, theencoding/decoding apparatus may derive mv₁ for the current block basedon Eq. 9 above S1620. The encoding/decoding apparatus may derive mv₁ byinserting the derived mv₀ and mv₂ into Eq. 9 above.

Afterwards, the encoding/decoding apparatus may provide the derived mv₀and mv₁ as constructed candidates of the current block S1610.

Meanwhile, another embodiment for deriving the inherited affinecandidate according to the present disclosure will be proposed. Inderiving an inherited affine candidate, the proposed embodiment mayreduce computational complexity, thereby improving coding performance.

FIG. 17 illustrates positions of neighboring blocks scanned for derivinginherited affine candidates.

The encoding/decoding apparatus may derive up to two inherited affinecandidates from neighboring blocks of the current block. FIG. 17illustrates neighboring blocks for the inherited affine candidates. Forexample, the neighboring blocks may include neighboring block A andneighboring block B shown in FIG. 17. The neighboring block A mayrepresent the left neighboring block A0, and the neighboring block B mayrepresent the top neighboring block B0.

For example, the encoding/decoding apparatus may check availability ofthe neighboring blocks in a specific order and may derive an inheritedaffine candidate of the current block based on a neighboring block firstconfirmed as available. In other words, the encoding/decoding apparatusmay check the neighboring blocks in a specific order to see whether theneighboring blocks satisfy a specific condition and derive an inheritedaffine candidate of the current block based on a neighboring block firstconfirmed as available. Also, the encoding/decoding apparatus may derivean inherited affine candidate of the current block based on aneighboring block second confirmed to satisfy the specific condition. Inother words, the encoding/decoding apparatus may derive an inheritedaffine candidate of the current block based on a neighboring blocksecond confirmed to satisfy the specific condition. Here, availabilitymay mean that a block is coded based on affine motion model, and thereference picture of the block is the same as the reference picture ofthe current block. In other words, the specific condition may indicatethat a block is coded based on affine motion model, and the referencepicture of the block is the same as the reference picture of the currentblock. Also, for example, the specific order may be performed fromneighboring block A to neighboring block B. Meanwhile, a pruning checkprocess may not be performed between two inherited affine candidates(namely, derived inherited affine candidates). The pruning check processmay represent a process that checks whether candidates are identical toeach other and removes the candidate derived later if they are found tobe identical.

The embodiment above proposes a method for checking only two neighboringblocks (namely, neighboring block A and neighboring block B) andderiving the inherited affine candidate instead of checking all theexisting neighboring blocks (namely, neighboring block A, neighboringblock B, neighboring block C, neighboring block D, and neighboring blockE) and deriving the inherited affine candidate. Here, neighboring blockC may represent the top-right corner neighboring block B1, neighboringblock D the bottom-left corner neighboring block A1, and neighboringblock E the top-left corner neighboring block B2.

When affine prediction is applied to each neighboring block to analyzespatial correlation among the neighboring blocks and the current block,a probability that affine prediction is applied to the current block maybe utilized. When affine prediction is applied to each neighboringblock, the probability that affine prediction is applied to the currentblock may be derived as shown in the table below.

TABLE 2 Reference block A B C D E Probability 65% 41% 5% 3% 1%

Referring to Table 2 above, it may be found that spatial correlationwith the current block is high for neighboring block A and neighboringblock B among the neighboring blocks. Therefore, through an embodimentthat derives the inherited affine candidate by using only neighboringblock A and neighboring block B that exhibit high spatial correlation,processing time may be reduced, and high decoding performance may beachieved.

Meanwhile, the pruning check process may be performed to prevent thesame candidate from existing in the candidate list. Since the pruningcheck process may remove redundancy, an advantageous effect may beobtained in terms of encoding efficiency, but at the same time,computational complexity may be increased due to the pruning checkprocess. In particular, since the pruning check process for affinecandidates has to be performed in consideration of affine type (forexample, whether affine motion model is four-parameter affine motionmodel or six-parameter affine motion model), reference picture (orreference picture index), and MVs of CP0, CP1, and CP2, computationalcomplexity is quite high. Therefore, the present embodiment proposes amethod which does not perform the pruning check process between theinherited affine candidate derived based on neighboring block A (forexample, inherited_A) and the inherited affine candidate derived basedon neighboring block B (for example, inherited_B). In the case ofneighboring blocks A and B, they are distant from each other and thusshow low spatial correlation; therefore, the possibility is low thatinherited_A and inherited_B are the same. Therefore, it may be desirablethat the pruning check process is not performed between the inheritedaffine candidates.

Also, based on the grounds above, a method for performing the pruningcheck process as little as possible may be proposed. For example, theencoding/decoding apparatus may perform the pruning check process insuch a way that only the MVs of CP0 of the inherited affine candidatesare compared with each other.

Also, the present disclosure proposes a method for deriving aconstructed candidate different from that obtained by the embodimentabove. Compared with the embodiment for deriving a constructed candidateabove, the proposed embodiment may improve coding performance byreducing complexity. The proposed embodiment may be described asfollows. Also, when the number of the inherited affine candidatesavailable is less than 2 (namely when the number of inherited affinecandidates derived is less than 2), constructed affine candidates may beconsidered.

For example, the encoding/decoding apparatus may check mv₀, mv₁, and mv₂for the current block. In other words, the encoding/decoding apparatusmay determine whether mv₀, mv₁, and mv₂ are available among neighboringblocks of the current block. Here, mv₀ may represent CPMVP candidate ofCP0 of the current block, mv₁ may represent CPMVP candidate of CP1 ofthe current block, and mv₂ may represent CPMVP candidate of CP2 of thecurrent block.

Specifically, the neighboring blocks of the current block may be dividedinto three groups, and the neighboring blocks may include a neighboringblock A, a neighboring block B, a neighboring block C, a neighboringblock D, a neighboring block E, a neighboring block F, and a neighboringblock G. The first group may include a motion vector of the neighboringblock A, a motion vector of the neighboring block B, and a motion vectorof the neighboring block C; the second group, a motion vector of theneighboring block D, and a motion vector of the neighboring block E; andthe third group, a motion vector of the neighboring block F, and amotion vector of the neighboring block G. The neighboring block A mayrepresent a neighboring block located top left of a top-left sampleposition of the current block; the neighboring block B, a neighboringblock located top of the top-left sample position of the current block;the neighboring block C, a neighboring block located left of thetop-left sample position of the current block; the neighboring block D,a neighboring block located top of a top-right sample position of thecurrent block; the neighboring block E, a neighboring block located topright of the top-right sample position of the current block; theneighboring block F, a neighboring block located left of the bottom-leftsample position of the current block; and the neighboring block G, aneighboring block located bottom left of the bottom-left sample positionof the current block.

The encoding/decoding apparatus may determine availability of mv₀ withinthe first group, determine availability of mv₁ within the second group,and availability of mv₂ within the third group.

More specifically, for example, the encoding/decoding apparatus maycheck whether motion vectors of neighboring blocks within a first groupsatisfy a specific condition according to a specific order. Theencoding/decoding apparatus may derive the motion vector of aneighboring block first confirmed to satisfy the condition during thechecking process as mv₀. In other words, mv₀ may be the motion vectorfirst confirmed to satisfy the specific condition from checking ofmotion vectors within the first group according to a specific order. Ifmotion vectors of the neighboring blocks within the first group do notsatisfy the specific condition, available mv₀ may not exist. Here, forexample, the specific order may be performed in order of neighboringblock A within the first group, neighboring block B, and neighboringblock C. Also, for example, the specific condition may be such that thereference picture for a motion vector of a neighboring block is the sameas the reference picture of the current block.

Also, the encoding/decoding apparatus may check whether motion vectorsof neighboring blocks within a second group satisfy a specific conditionaccording to a specific order. The encoding/decoding apparatus mayderive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₁. In otherwords, mv₁ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the secondgroup according to a specific order. If motion vectors of theneighboring blocks within the second group do not satisfy the specificcondition, available mv₁ may not exist. Here, for example, the specificorder may be performed from neighboring block D within the second groupto neighboring block E. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

Also, the encoding/decoding apparatus may check whether motion vectorsof neighboring blocks within a third group satisfy a specific conditionaccording to a specific order. The encoding/decoding apparatus mayderive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₂. In otherwords, mv₂ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the thirdgroup according to a specific order. If motion vectors of theneighboring blocks within the third group do not satisfy the specificcondition, available mv₂ may not exist. Here, for example, the specificorder may be performed from neighboring block F within the third groupto neighboring block G. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

Afterwards, if the affine motion model applied to the current block is4-parameter affine motion model, and mv₀ and mv₁ for the current blockare available, the encoding/decoding apparatus may provide the derivedmv₀ and mv₁ as constructed candidates of the current block. Meanwhile,if mv₀ and/or mv₁ for the current block is not available, namely, if atleast one of mv₀ and mv₁ is not derived from neighboring blocks of thecurrent block, the encoding/decoding apparatus may not add a constructedcandidate to the affine MVP list of the current block.

Also, if the affine motion model applied to the current block is6-parameter affine motion model, and mv₀, mv₁, and mv₂ for the currentblock are available, the encoding/decoding apparatus may provide thederived mv₀, mv₁, and mv₂ as constructed candidates of the currentblock. Meanwhile, if mv₀, mv₁, and/or mv₂ for the current block is notavailable, namely, if at least one of mv₀, mv₁, and mv₂ is not derivedfrom neighboring blocks of the current block, the encoding/decodingapparatus may not add a constructed candidate to the affine MVP list ofthe current block.

The proposed embodiment describes a method that considers motion vectorsof CPs for generating affine motion model of the current block asconstructed candidates only when all the motion vectors are available.Here, availability may mean that the reference picture of a neighboringblock is the same as the reference picture of the current block. Inother words, the constructed candidate may be derived only when thereexists a motion vector that satisfies the condition among motion vectorsof neighboring blocks for the respective CPs of the current block.Therefore, if affine motion model applied to the current block is4-parameter affine motion model, the constructed candidate may beconsidered only when motion vectors of CP0 and CP1 of the current block(namely, mv₀ and mv₁) are available. Also, if affine motion modelapplied to the current block is 6-parameter affine motion model, theconstructed candidate may be considered only when motion vectors of CP0,CP1, and CP2 of the current block (namely, mv₀, mv₁, and mv₂) areavailable. Therefore, according to the proposed embodiment, theadditional construction for deriving a motion vector for a CP based onEq. 8 or 9 may not be needed. Through the proposed embodiment,computational complexity for deriving the constructed candidate may bereduced. Also, since the constructed candidate is determined only whenthe CPMVP candidate having the same reference picture is available, theoverall coding performance may be improved.

Meanwhile, a pruning check process may not be performed between aderived inherited affine candidate and the constructed affine candidate.The pruning check process may represent a process that checks whetherthe candidates are identical to each other and removes the candidatederived later if they are found to be identical.

The embodiment described above may be illustrated as shown in FIGS. 18and 19.

FIG. 18 illustrates one example of deriving the constructed candidatewhen four-parameter affine motion model is applied to the current block.

Referring to FIG. 18, the encoding/decoding apparatus may determinewhether mv₀ and mv₁ for the current block are available S1800. In otherwords, the encoding/decoding apparatus may determine whether availablemv₀ and mv₁ exist in the neighboring blocks of the current block. Here,mv₀ may be the CPMVP candidate of CP0 of the current block, and mv₁ maybe the CPMVP candidate of CP1.

The encoding/decoding apparatus may determine whether mv₀ is availablein the first group and whether mv₁ is available in the second group.

Specifically, the neighboring blocks of the current block may be dividedinto three groups, and the neighboring blocks may include a neighboringblock A, a neighboring block B, a neighboring block C, a neighboringblock D, a neighboring block E, a neighboring block F, and a neighboringblock G. The first group may include a motion vector of the neighboringblock A, a motion vector of the neighboring block B, and a motion vectorof the neighboring block C; the second group, a motion vector of theneighboring block D, and a motion vector of the neighboring block E; andthe third group, a motion vector of the neighboring block F, and amotion vector of the neighboring block G. The neighboring block A mayrepresent a neighboring block located top left of a top-left sampleposition of the current block; the neighboring block B, a neighboringblock located top of the top-left sample position of the current block;the neighboring block C, a neighboring block located left of thetop-left sample position of the current block; the neighboring block D,a neighboring block located top of a top-right sample position of thecurrent block; the neighboring block E, a neighboring block located topright of the top-right sample position of the current block; theneighboring block F, a neighboring block located left of the bottom-leftsample position of the current block; and the neighboring block G, aneighboring block located bottom left of the bottom-left sample positionof the current block.

The encoding/decoding apparatus may check whether motion vectors ofneighboring blocks within the first group satisfy a specific conditionaccording to a specific order. The encoding/decoding apparatus mayderive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₀. In otherwords, mv₀ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the firstgroup according to a specific order. If motion vectors of theneighboring blocks within the first group do not satisfy the specificcondition, available mv₀ may not exist. Here, for example, the specificorder may be performed in order of neighboring block A within the firstgroup, neighboring block B, and neighboring block C. Also, for example,the specific condition may be such that the reference picture for amotion vector of a neighboring block is the same as the referencepicture of the current block.

Also, the encoding/decoding apparatus may check whether motion vectorsof neighboring blocks within the second group satisfy a specificcondition according to a specific order. The encoding/decoding apparatusmay derive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₁. In otherwords, mv₁ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the secondgroup according to a specific order. If motion vectors of theneighboring blocks within the second group do not satisfy the specificcondition, available mv₁ may not exist. Here, for example, the specificorder may be performed from neighboring block D within the second groupto neighboring block E. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

If mv₀ and mv₁ for the current block are available, namely, if mv₀ andmv₁ for the current block are derived, the encoding/decoding apparatusmay provide the derived mv₀ and mv₁ as constructed candidates of thecurrent block S1810. Meanwhile, if mv₀ and/or mv₁ for the current blockis not available, namely, if at least one of mv₀ and mv₁ is not derivedfrom neighboring blocks of the current block, the encoding/decodingapparatus may not add a constructed candidate to the affine MVP list ofthe current block.

Meanwhile, a pruning check process may not be performed between aderived inherited affine candidate and the constructed affine candidate.The pruning check process may represent a process that checks whetherthe candidates are identical to each other and removes the candidatederived later if they are found to be identical.

FIG. 19 illustrates one example of deriving the constructed candidatewhen six-parameter affine motion model is applied to the current block.

Referring to FIG. 19, the encoding/decoding apparatus may determinewhether mv₀, mv₁, and mv₂ for the current block are available S1900. Inother words, the encoding/decoding apparatus may determine whetheravailable mv₀, mv₁, and mv₂ exist in the neighboring blocks of thecurrent block. Here, mv₀ may be the CPMVP candidate of CP0 of thecurrent block, mv₁ the CPMVP candidate of CP1, and mv₂ the CPMVPcandidate of CP2.

The encoding/decoding apparatus may determine whether mv₀ is availablein the first group, mv₁ in the second group, and mv₂ in the third group.

Specifically, the neighboring blocks of the current block may be dividedinto three groups, and the neighboring blocks may include a neighboringblock A, a neighboring block B, a neighboring block C, a neighboringblock D, a neighboring block E, a neighboring block F, and a neighboringblock G. The first group may include a motion vector of the neighboringblock A, a motion vector of the neighboring block B, and a motion vectorof the neighboring block C; the second group, a motion vector of theneighboring block D, and a motion vector of the neighboring block E; andthe third group, a motion vector of the neighboring block F, and amotion vector of the neighboring block G. The neighboring block A mayrepresent a neighboring block located top left of a top-left sampleposition of the current block; the neighboring block B, a neighboringblock located top of the top-left sample position of the current block;the neighboring block C, a neighboring block located left of thetop-left sample position of the current block; the neighboring block D,a neighboring block located top of a top-right sample position of thecurrent block; the neighboring block E, a neighboring block located topright of the top-right sample position of the current block; theneighboring block F, a neighboring block located left of the bottom-leftsample position of the current block; and the neighboring block G, aneighboring block located bottom left of the bottom-left sample positionof the current block.

The encoding/decoding apparatus may check whether motion vectors ofneighboring blocks within the first group satisfy a specific conditionaccording to a specific order. The encoding/decoding apparatus mayderive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₀. In otherwords, mv₀ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the firstgroup according to a specific order. If motion vectors of theneighboring blocks within the first group do not satisfy the specificcondition, available mv₀ may not exist. Here, for example, the specificorder may be performed in order of neighboring block A within the firstgroup, neighboring block B, and neighboring block C. Also, for example,the specific condition may be such that the reference picture for amotion vector of a neighboring block is the same as the referencepicture of the current block.

Also, the encoding/decoding apparatus may check whether motion vectorsof neighboring blocks within the second group satisfy a specificcondition according to a specific order. The encoding/decoding apparatusmay derive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₁. In otherwords, mv₁ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the secondgroup according to a specific order. If motion vectors of theneighboring blocks within the second group do not satisfy the specificcondition, available mv₁ may not exist. Here, for example, the specificorder may be performed from neighboring block D within the second groupto neighboring block E. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

Also, the encoding/decoding apparatus may check whether motion vectorsof neighboring blocks within the third group satisfy a specificcondition according to a specific order. The encoding/decoding apparatusmay derive the motion vector of a neighboring block first confirmed tosatisfy the condition during the checking process as mv₂. In otherwords, mv₂ may be the motion vector first confirmed to satisfy thespecific condition from checking of motion vectors within the thirdgroup according to a specific order. If motion vectors of theneighboring blocks within the third group do not satisfy the specificcondition, available mv₂ may not exist. Here, for example, the specificorder may be performed from neighboring block F within the third groupto neighboring block G. Also, for example, the specific condition may besuch that the reference picture for a motion vector of a neighboringblock is the same as the reference picture of the current block.

If mv₀, mv₁, and mv₂ for the current block are available, namely, ifmv₀, and mv₂ for the current block are derived, the encoding/decodingapparatus may provide the derived mv₀, mv₁, and mv₂ as constructedcandidates of the current block S1910. Meanwhile, if mv₀, mv₁, and/ormv₂ for the current block is not available, namely, if at least one ofmv₀, mv₁, and mv₂ is not derived from neighboring blocks of the currentblock, the encoding/decoding apparatus may not add a constructedcandidate to the affine MVP list of the current block.

Meanwhile, a pruning check process may not be performed between aderived inherited affine candidate and the constructed affine candidate.

Meanwhile, when the number of derived affine candidates is less than 2(namely, when the number of inherited affine candidates and/or thenumber of constructed affine candidates is less than 2), an HEVC AMVPcandidate may be added to the affine MVP list of the current block.

For example, the HEVC AMVP candidate may be derived in the followingorder.

More specifically, when the number of derived affine candidate is lessthan 2, and CPMV0 of the constructed affine candidate is available, theCPMV0 may be used as the affine MVP candidate. In other words, when thenumber of derived affine candidates is less than 2, and the CPMV0 of theconstructed affined candidate is available (namely, when the number ofderived affine candidates is less than 2, and CPMV0 of the constructedaffine candidate is derived), the CPMV0 of the constructed affinecandidate may be derived as a first affine MVP candidate includingCPMV0, CPMV1, and CPMV2.

Also, next, when the number of derived affine candidates is less than 2,and the CPMV1 of the constructed affine candidate is available, theCPMV1 may be used as the affine MVP candidate. In other words, when thenumber of derived affine candidates is less than 2, and the CPMV1 of theconstructed affined candidate is available (namely, when the number ofderived affine candidates is less than 2, and CPMV1 of the constructedaffine candidate is derived), the CPMV1 of the constructed affinecandidate may be derived as a second affine MVP candidate includingCPMV0, CPMV1, and CPMV2.

Also, next, when the number of derived affine candidates is less than 2,and the CPMV2 of the constructed affine candidate is available, theCPMV2 may be used as the affine MVP candidate. In other words, when thenumber of derived affine candidates is less than 2, and the CPMV2 of theconstructed affined candidate is available (namely, when the number ofderived affine candidates is less than 2, and CPMV2 of the constructedaffine candidate is derived), the CPMV2 of the constructed affinecandidate may be derived as a third affine MVP candidate includingCPMV0, CPMV1, and CPMV2.

Also, next, when the number of derived affine candidates is less than 2,an HEVC Temporal Motion Vector Predictor (TMVP) may be used as theaffine MVP candidate. The HEVC TMVP may be derived based on motioninformation of a temporal neighboring block of the current block. Inother words, when the number of derived affine candidates is less than2, a motion vector of a temporal neighboring block of the current blockmay be derived as the third affine MVP candidate including CPMV0, CPMV1,and CPMV2. The temporal neighboring block may indicate a collocatedblock within a collocated picture corresponding to the current block.

Also, next, when the number of derived affine candidates is less than 2,a zero motion vector (MV) may be used as the affine MVP candidate. Inother words, when the number of derived affine candidates is less than2, the zero motion vector may be derived as the third affine MVPcandidate including CPMV0, CPMV1, and CPMV2. The zero motion vector mayrepresent a motion vector whose elements are all zeros.

The processing steps using CPMVs of constructed affine candidates reusethe MVs already considered for generation of constructed affinecandidates, thereby lowering processing complexity compared with theexisting method for deriving HEVC AMVP candidates.

Meanwhile, the present disclosure proposes another embodiment forderiving the inherited affine candidate.

To derive the inherited affine candidate, affine prediction informationof neighboring blocks is needed, and more specifically, affineprediction information is needed as follows:

1) Affine flag (affine_flag) indicating whether affine prediction-basedencoding has been applied to the neighboring blocks, and

2) Motion information of the neighboring blocks.

If four-parameter affine motion model is applied to the neighboringblocks, motion information of the neighboring blocks may include L0motion information and L1 motion information for CP0, and L0 motioninformation and L1 motion information for CP1. Also, if six-parameteraffine motion model is applied to the neighboring blocks, motioninformation of the neighboring blocks may include L0 motion informationand L1 motion information for CP0, and L0 motion information and L1motion information for CP2. Here, the L0 motion information mayrepresent motion information for List 0 (L0), and the L1 motioninformation may represent motion information for List 1 (L1). The L0motion information may include L0 reference picture index and L0 motionvector, and the L1 motion information may include L1 reference pictureindex and L1 motion vector.

As described above, in the case of affine prediction, a large amount ofinformation has to be stored, which may be the primary cause thatincreases hardware cost in actual implementation of an encoding/decodingapparatus. In particular, if a neighboring block is located above acurrent block and belongs to the CTU boundary, a line buffer needs to beused to store information related to affine prediction of theneighboring block, which may further increase the implementation cost.In what follows, the problem may be referred to as a line buffer issue.In this regard, the present disclosure proposes an embodiment forderiving an inherited affine candidate that minimizes the hardware costby not storing or by reducing affine prediction-related information inthe line buffer. The proposed embodiment may improve coding performanceby reducing computational complexity in deriving the inherited affinecandidate. Meanwhile, it should be noted that the line buffer alreadystores motion information on a block of 4×4 size, and if the affineprediction-related information is additionally stored, the amount ofinformation stored may be increased three times the existing amount ofstorage.

In the present embodiment, no additional information on affineprediction may be stored in the line buffer, and when the informationwithin the line buffer has to be utilized to generate the inheritedaffine candidate, generation of the inherited affine candidate may belimited.

FIGS. 20a to 20b illustrate an embodiment for deriving the inheritedaffine candidate.

Referring to FIG. 20a , when neighboring block B of the current block(namely, the neighboring block above the current block) does not belongto the same CTU as the current block, the neighboring block B may not beused for generation of the inherited affine candidate. Meanwhile,although neighboring block A also does not belong to the same CTU as thecurrent block, information on the neighboring block A is not stored inthe line buffer, and thus the neighboring block A may be used forgeneration of the inherited affine candidate. Therefore, according tothe present embodiment, only when the neighboring block above thecurrent block belongs to the same CTU as the current block, theneighboring block may be used for deriving the inherited affinecandidate. Also, when the neighboring block above the current block doesnot belong to the same CTU as the current block, the top neighboringblock may not be used for deriving the inherited affine candidate.

Referring to FIG. 20b , neighboring block B of the current block(namely, the neighboring block above the current block) may belong tothe same CTU as the current block. In this case, the encoding/decodingapparatus may generate the inherited affine candidate by referring tothe neighboring block B.

FIG. 21 illustrates a video encoding method performed by an encodingapparatus according to the present disclosure. The method disclosed inFIG. 21 may be performed by the encoding apparatus disclosed in FIG. 2.More specifically, for example, S2100 to S2120 steps may be performed bythe predictor of the encoding apparatus, S2130 step by the subtractor ofthe encoding apparatus, and S2140 step by the entropy encoder of theencoding apparatus. Also, although not shown in the figure, the processfor deriving prediction samples for the current block based on the CPMVsmay be performed by the predictor of the encoding apparatus, the processfor deriving residual samples for the current block based on theoriginal samples and prediction samples for the current block may beperformed by the subtractor of the encoding apparatus, the process forgenerating information on residuals for the current block based on theresidual samples may be performed by the transformer of the encodingapparatus, and the process for encoding information on the residuals maybe performed by the encoder of the encoding apparatus.

The encoding apparatus constructs an affine Motion Vector Predictor(MVP) candidate list for the current block S2100. The encoding apparatusmay construct an affine MVP candidate list including affine MVPcandidates for the current block. The maximum number of the affine MVPcandidates of the affine MVP candidate list may be 2.

Also, as one example, the affine MVP candidate list may includeinherited affine MVP candidates. The encoding apparatus may checkwhether inherited affine MVP candidates of the current block areavailable, and if the inherited affine MVP candidates are available, theinherited affine MVP candidate may be derived. For example, theinherited affine MVP candidates may be derived based on neighboringblocks of the current block, and the maximum number of the inheritedaffine MVP candidates may be 2. Availability of the neighboring blocksmay be checked in a specific order, and the inherited affine MVPcandidates may be derived based on available neighboring blocks checked.In other words, availability of the neighboring blocks may be checked ina specific order, a first inherited affine MVP candidate may be derivedbased on the available neighboring block checked first, and a secondinherited affine MVP candidate may be derived based on the availableneighboring block checked second. The availability may mean that aneighboring block is coded based on affine motion model, and thereference picture of the neighboring block is the same as the referencepicture of the current block. In other words, an available neighboringblock may refer to a neighboring block coded according to affine motionmodel (namely, a neighboring block to which affine prediction isapplied) and whose reference picture is the same as the referencepicture of the current block. More specifically, the encoding apparatusmay derive motion vectors for CPs of the current block based on theaffine motion model of the available neighboring block checked first andderive the first inherited affine MVP candidate including the motionvectors as CPMVP candidates. Also, the encoding apparatus may derivemotion vectors for CPs of the current block based on the affine motionmodel of the available neighboring block checked second and derive thesecond inherited affine MVP candidate including the motion vectors asCPMVP candidates. The affine motion model may be derived by Eq. 1 or Eq.3 above.

Also, in other words, the neighboring blocks may be checked in aspecific order to see whether the neighboring blocks satisfy a specificcondition, and the inherited affine MVP candidates may be derived basedon neighboring blocks satisfying the checked specific condition. Inother words, the neighboring blocks may be checked in a specific orderto see whether the neighboring blocks satisfy the specific condition, afirst inherited affine MVP candidate may be derived based on theneighboring block first checked to satisfy the specific condition, and asecond inherited affine MVP candidate may be derived based on theneighboring block second checked to satisfy the specific condition. Morespecifically, the encoding apparatus may derive motion vectors for CPsof the current block based on the affine motion model of the neighboringblocks first checked to satisfy the specific condition and derive thefirst inherited affine MVP candidate including the motion vectors asCPMVP candidates. Also, the encoding apparatus may derive motion vectorsfor CPs of the current block based on the affine motion model of theneighboring blocks second checked to satisfy the specific condition andderive the second inherited affine MVP candidate including the motionvectors as CPMVP candidates. The affine motion model may be derived byEq. 1 or Eq. 3 above. Meanwhile, the specific condition may indicatethat the neighboring block is coded according to affine motion model,and the reference picture of the neighboring block is the same as thereference picture of the current block. In other words, the neighboringblock satisfying the specific condition may be coded according to affinemotion model (namely, affine prediction is applied to the neighboringblock), and the reference picture is the same as the reference pictureof the current block.

Here, for example, the neighboring blocks may include the leftneighboring block, top neighboring block, top-right corner neighboringblock, bottom-left corner neighboring block, and top-left cornerneighboring block of the current block. In this case, the specific ordermay be an order from the left neighboring block to the bottom-leftcorner neighboring block to the top neighboring block to the top-rightcorner neighboring block to the top-left corner neighboring block.

Or, for example, the neighboring blocks may include only the leftneighboring block and the top neighboring block. In this case, thespecific order may be an order from the left neighboring block to thetop neighboring block.

Or, for example, the neighboring blocks may include the left neighboringblock, and if the top neighboring block belongs to the current CTU whichincludes the current block, the neighboring blocks may further includethe top neighboring block. In this case, the specific order may be anorder from the left neighboring block to the top neighboring block.Also, if the top neighboring block does not belong to the current CTU,the neighboring blocks may not include the top neighboring block. Inthis case, only the left neighboring block may be checked.

Meanwhile, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, the bottom-left corner neighboring block may be the blockincluding a sample at the coordinates of (−1, H), the left neighboringblock may be the block including a sample at the coordinates of (01,H−1), the top-right corner neighboring block may be the block includinga sample at the coordinates of (W, −1), the top neighboring block may bethe block including a sample at the coordinates of (W−1, −1), thetop-left corner neighboring block may be the block including a sample atthe coordinates of (−1, −1). In other words, the left neighboring blockmay be the left neighboring block at the lowest position among the leftneighboring blocks of the current block, and the top neighboring blockmay be the top neighboring block at the most left position among the topneighboring blocks of the current block.

Also, as one example, if a constructed affine MVP candidate isavailable, the affine MVP candidate list may include the constructedaffine MVP candidate. The encoding apparatus may check whether theconstructed affine MVP candidate of the current block is available, andif the constructed affine MVP candidate is available, the constructedaffine MVP candidate may be derived. Also, for example, after theinherited affine MVP candidate is derived, the constructed affine MVPcandidate may be derived. If the number of derived affine MVP candidates(namely, the number of inherited affine MVPs) is less than 2, and theconstructed affine MVP candidate is available, the affine MVP candidatelist may include the constructed affine MVP candidate. Here, theconstructed affine MVP candidate may include candidate motion vectorsfor the CPs. The constructed affine MVP candidate may be available whenall the candidate motion vectors are available.

For example, if four-parameter affine motion model is applied to thecurrent block, the CPs of the current block may include CP0 and CP1. Ifthe candidate motion vector for the CP0 is available, and the candidatemotion vector for the CP1 is available, the constructed affine MVPcandidate may be available, and the affine MVP candidate list mayinclude the constructed affine MVP candidate. Here, the CP0 mayrepresent the top-left position of the current block, and the CP1 mayrepresent the top-right position of the current block.

The constructed affine MVP candidate may include the candidate motionvector for CP0 and the candidate motion vector for CP1. The candidatemotion vector for CP0 may be the motion vector of a first block, and thecandidate motion vector for CP1 may be the motion vector of a secondblock.

Also, the first block may be a block which has been first confirmedwhile checking neighboring blocks in the first group in a first specificorder to be that a reference picture thereof is the same as a referencepicture of the current block. In other words, the candidate motionvector for CP1 may be the motion vector of the block whose referencepicture first confirmed by checking neighboring blocks within the firstgroup according to a first order is the same as the reference picture ofthe current block. The availability may indicate that the neighboringblock exists, and the neighboring block is coded by inter prediction.Here, if the reference picture of the first block within the first groupis the same as the reference picture of the current block, the candidatemotion vector for CP0 may be available. Also, for example, the firstgroup may include neighboring block A, neighboring block B, andneighboring block C, and the first specific order may be an order fromthe neighboring block A to the neighboring block B, and then to theneighboring block C.

Also, the second block may be a block which has been first confirmedwhile checking neighboring blocks in the second group in a secondspecific order to be that a reference picture thereof is the same as areference picture of the current block. Here, if the reference pictureof the second block within the second group is the same as the referencepicture of the current block, the candidate motion vector for CP1 may beavailable. Also, for example, the second group may include neighboringblock D and neighboring block E, and the second specific order may be anorder from the neighboring block D to the neighboring block E.

Meanwhile, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, neighboring block A may be the block including a sample atthe coordinates of (−1, −1), neighboring block B may be the blockincluding a sample at the coordinates of (0, −1), neighboring block Cmay be the block including a sample at the coordinates of (−1, 0),neighboring block D may be the block including a sample at thecoordinates of (W−1, −1), and neighboring block E may be the blockincluding a sample at the coordinates of (W, −1). In other words,neighboring block A may be the top-left corner neighboring block of thecurrent block, neighboring block B the top neighboring block at the mostleft position among top neighboring blocks of the current block,neighboring block C the left neighboring block at the highest positionamong left neighboring blocks of the current block, neighboring block Dthe top neighboring block at the most right position among topneighboring blocks of the current block, and neighboring block E thetop-right corner neighboring block of the current block.

Meanwhile, if at least one of the candidate motion vector of CP0 and thecandidate motion vector of CP1 is not available, the constructed affineMVP candidate may not be available.

Or, for example, if six-parameter affine motion model is applied to thecurrent block, the CPs of the current block may include CP0, CP1, andCP2. If the candidate motion vector for the CP0 is available, thecandidate motion vector for the CP1 is available, and the candidatemotion vector for the CP2 is available, the constructed affine MVPcandidate may be available, and the affine MVP candidate list mayinclude the constructed affine MVP candidate. Here, the CP0 mayrepresent the top-left position of the current block, the CP1 mayrepresent the top-right position of the current block, and the CP2 mayrepresent the bottom-left position of the current block.

The constructed affine MVP candidate may include the candidate motionvector for CP0, the candidate motion vector for CP1, and the candidatemotion vector for CP2. The candidate motion vector for CP0 may be themotion vector of a first block, the candidate motion vector for CP1 maybe the motion vector of a second block, and the candidate motion vectorfor CP2 may be the motion vector of a third block.

Also, the first block may be a block which has been first confirmedwhile checking neighboring blocks in the first group in a first specificorder to be that a reference picture thereof is the same as a referencepicture of the current block. Here, if the reference picture of thefirst block within the first group is the same as the reference pictureof the current block, the candidate motion vector for CP0 may beavailable. Also, for example, the first group may include neighboringblock A, neighboring block B, and neighboring block C, and the firstspecific order may be an order from the neighboring block A to theneighboring block B, and then to the neighboring block C.

Also, the second block may be a block which has been first confirmedwhile checking neighboring blocks in the second group in a secondspecific order to be that a reference picture thereof is the same as areference picture of the current block. Here, if the reference pictureof the second block within the second group is the same as the referencepicture of the current block, the candidate motion vector for CP1 may beavailable. Also, for example, the second group may include neighboringblock D and neighboring block E, and the second specific order may be anorder from the neighboring block D to the neighboring block E.

Also, the third block may be a block which has been first confirmedwhile checking neighboring blocks in the third group in a third specificorder to be that a reference picture thereof is the same as a referencepicture of the current block. Here, if the reference picture of thethird block within the third group is the same as the reference pictureof the current block, the candidate motion vector for CP2 may beavailable. Also, for example, the third group may include neighboringblock F and neighboring block G, and the third specific order may be anorder from the neighboring block F to the neighboring block G.

Meanwhile, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, neighboring block A may be the block including a sample atthe coordinates of (−1, −1), neighboring block B may be the blockincluding a sample at the coordinates of (0, −1), neighboring block Cmay be the block including a sample at the coordinates of (−1, 0),neighboring block D may be the block including a sample at thecoordinates of (W−1, −1), neighboring block E may be the block includinga sample at the coordinates of (W, −1), and neighboring block F may bethe block including a sample at the coordinates of (−1, H−1), andneighboring block G may be the block including a sample at thecoordinates of (−1, H). In other words, neighboring block A may be thetop-left corner neighboring block of the current block, neighboringblock B the top neighboring block at the most left position among topneighboring blocks of the current block, neighboring block C the leftneighboring block at the highest position among left neighboring blocksof the current block, neighboring block D the top neighboring block atthe most right position among top neighboring blocks of the currentblock, neighboring block E the top-right corner neighboring block of thecurrent block, neighboring block F the left neighboring block at thelowest position among left neighboring blocks of the current block, andneighboring block G the bottom-left corner neighboring block of thecurrent block.

Meanwhile, if at least one of the candidate motion vector of CP0, thecandidate motion vector of CP1, and the candidate motion vector of CP2is not available, the constructed affine MVP candidate may not beavailable.

Afterwards, the affine MVP candidate list may be derived based on thesteps described below.

For example, when the number of derived affine MVP candidates is lessthan 2, and the motion vector for CP0 is available, the encodingapparatus may derive a first affine MVP candidate. Here, the firstaffine MVP candidate may be the affine MVP candidate including themotion vector for CP0 as the candidate motion vectors for the CPs.

Also, for example, when the number of derived affine MVP candidates isless than 2, and the motion vector for CP1 is available, the encodingapparatus may derive a second affine MVP candidate. Here, the secondaffine MVP candidate may be the affine MVP candidate including themotion vector for CP1 as the candidate motion vectors for the CPs.

Also, for example, when the number of derived affine MVP candidates isless than 2, and the motion vector for CP2 is available, the encodingapparatus may derive a third affine MVP candidate. Here, the thirdaffine MVP candidate may be the affine MVP candidate including themotion vector for CP2 as the candidate motion vectors for the CPs.

Also, for example, when the number of derived affine MVP candidates isless than 2, the encoding apparatus may derive a fourth affine MVPcandidate including a temporal MVP derived based on a temporalneighboring block of the current block as the candidate motion vectorsfor the CPs. The temporal neighboring block may refer to the samecollocated block within the same collocated picture corresponding to thecurrent block. The temporal MVP may be derived based on the motionvector of the temporal neighboring block.

Also, for example, when the number of derived affine MVP candidates isless than 2, the encoding apparatus may derive a fifth affine MVPcandidate including a zero motion vector as the candidate motion vectorsfor the CPs. The zero motion vector may represent a motion vector whoseelements are all zeros.

The encoding apparatus derives Control Point Motion Vector Predictors(CPMVPs) for Control Points (CPs) of the current block based on theaffine MVP candidate list S2110. The encoding apparatus may derive CPMVsfor the CPs of the current block exhibiting the optimal RD cost and mayselect, among the affine MVP candidates, an affine MVP candidate mostsimilar to the CPMVs as the affine MVP candidate for the current block.The encoding apparatus may derive CPMVPs for CPs of the current blockbased on the affine MVP candidate selected among the affine MVPcandidates. More specifically, if an affine MVP candidate includes acandidate motion vector for CP0 and a candidate motion vector for CP1,the candidate motion vector for CP0 of the affine MVP candidate may bederived as CPMVP of the CP0, and the candidate motion vector for CP1 ofthe affine MVP candidate may be derived as CPMVP of the CP1. Also, if anaffine MVP candidate includes a candidate motion vector for CP0, acandidate motion vector for CP1, and a candidate motion vector for CP2,the candidate motion vector for CP0 of the affine MVP candidate may bederived as CPMVP of the CP0, the candidate motion vector for CP1 of theaffine MVP candidate may be derived as CPMVP of the CP1, and thecandidate motion vector for CP2 of the affine MVP candidate may bederived as CPMVP of the CP2. Also, if an affine MVP candidate includes acandidate motion vector for CP0 and a candidate motion vector for CP2,the candidate motion vector for CP0 of the affine MVP candidate may bederived as CPMVP of the CP0, and the candidate motion vector for CP2 ofthe affine MVP candidate may be derived as CPMVP of the CP2.

The encoding apparatus may encode an affine MVP candidate indexindicating the selected affine MVP candidate among the affine MVPcandidates. The affine MVP candidate index may indicate the one affineMVP candidate among affine MVP candidates included in the affine motionvector predictor (MVP) candidate list for the current block.

The encoding apparatus derives CPMVs for the CPs of the current blockS2120. The encoding apparatus may derive CPMVs for the respective CPs ofthe current block.

The encoding apparatus derives Control Point Motion Vector Differences(CPMVDs) for the CPs of the current block based on the CPMVPs and theCPMVs S2130. The encoding apparatus may derive CPMVDs for the CPs of thecurrent block based on the CPMVPs and the CPMVs for the respective CPs.

The encoding apparatus encodes motion prediction information includinginformation on the CPMVDs S2140. The encoding apparatus may output themotion prediction information including the information on the CPMVDs inthe form of a bitstream. In other words, the encoding apparatus mayoutput image information including the motion prediction information inthe form of a bitstream. The encoding apparatus may encode informationon the CPMVDs for the respective CPs, where the motion predictioninformation may include information on the CPMVDs.

Also, the motion prediction may include the affine MVP candidate index.The affine MVP candidate index may indicate the selected affine MVPcandidate among affine MVP candidates included in the affine MotionVector Predictor (MVP) candidate list for the current block.

Meanwhile, as one example, the encoding apparatus may derive predictionsamples for the current block based on the CPMVs, derive residualsamples for the current block based on the original samples andprediction samples for the current block, generate information on theresiduals for the current block based on the residual samples, andencode information on the residuals. The image information may includeinformation on the residuals.

Meanwhile, the bitstream may be transmitted to the decoding apparatusthrough a network or a (digital) storage medium. Here, the network mayinclude a broadcast network and/or a communication network, and thedigital storage medium may include various types of storage mediaincluding USB, SD, CD, DVD, Bluray, HDD, and SSD.

FIG. 22 illustrates an encoding apparatus performing a video encodingmethod according to the present disclosure. The method disclosed in FIG.21 may be performed by the encoding apparatus disclosed in FIG. 22. Morespecifically, for example, the predictor of the encoding apparatus mayperform S2100 to S2130 step of FIG. 21, and the entropy encoder of theencoding apparatus of FIG. 22 may perform S2140 step of FIG. 21. Also,although not shown in the figure, a process for deriving predictionsamples for the current block based on the CPMVs may be performed by thepredictor of the encoding apparatus of FIG. 22, a process for derivingresidual samples for the current block based on the original samples andthe prediction samples for the current block may be performed by thesubtractor of the encoding apparatus of FIG. 22, a process forgenerating information on the residuals for the current block based onthe residual samples may be performed by the transformer of the encodingapparatus, and a process for encoding information on the residuals maybe performed by the entropy encoder of the encoding apparatus of FIG.22.

FIG. 23 illustrates a video decoding method performed by a decodingapparatus according to the present disclosure. The method disclosed inFIG. 23 may be performed by the decoding apparatus disclosed in FIG. 3.More specifically, for example, S2300 step of FIG. 23 may be performedby the entropy decoder of the decoding apparatus, S2310 to S2350 stepsmay be performed by the predictor of the decoding apparatus, and S2360step may be performed by the adder of the decoding apparatus. Also,although not shown in the figure, a process for obtaining information onresiduals of a current block through a bitstream may be performed by theentropy decoder of the decoding apparatus, and a process for derivingthe residual samples for the current block based on the residualinformation may be performed by the inverse transformer of the decodingapparatus.

The decoding apparatus obtains motion prediction information on acurrent block from a bitstream S2300. The decoding apparatus may obtainimage information including the motion prediction information from thebitstream.

Also, for example, the motion prediction information may includeinformation on Control Point Motion Vector Differences (CPMVDs) forControl Points (CPs) of the current block. In other words, the motionprediction information may include information on the CPMVDs for therespective CPs of the current block.

Also, for example, the motion prediction information may include anaffine Motion Vector Predictor (MVP) candidate index for the currentblock. The affine MVP candidate index may indicate one of the affine MVPcandidates included in the affine MVP candidate list for the currentblock.

The decoding apparatus constructs an affine MVP candidate list for thecurrent block S2310. The decoding apparatus may construct an affine MVPcandidate list including affine MVP candidates for the current block.The maximum number of the affine MVP candidates of the affine MVPcandidate list may be 2.

Also, as one example, the affine MVP candidate list may includeinherited affine MVP candidates. The decoding apparatus may checkwhether inherited affine MVP candidates of the current block areavailable, and if the inherited affine MVP candidates are available, theinherited affine MVP candidate may be derived. For example, theinherited affine MVP candidates may be derived based on neighboringblocks of the current block, and the maximum number of the inheritedaffine MVP candidates may be 2. Availability of the neighboring blocksmay be checked in a specific order, and the inherited affine MVPcandidates may be derived based on available neighboring blocks checked.In other words, availability of the neighboring blocks may be checked ina specific order, a first inherited affine MVP candidate may be derivedbased on the available neighboring block checked first, and a secondinherited affine MVP candidate may be derived based on the availableneighboring block checked second. The availability may mean that aneighboring block is coded based on affine motion model, and thereference picture of the neighboring block is the same as the referencepicture of the current block. In other words, an available neighboringblock may refer to a neighboring block coded according to affine motionmodel (namely, a neighboring block to which affine prediction isapplied) and whose reference picture is the same as the referencepicture of the current block. More specifically, the decoding apparatusmay derive motion vectors for CPs of the current block based on theaffine motion model of the available neighboring block checked first andderive the first inherited affine MVP candidate including the motionvectors as CPMVP candidates. Also, the decoding apparatus may derivemotion vectors for CPs of the current block based on the affine motionmodel of the available neighboring block checked second and derive thesecond inherited affine MVP candidate including the motion vectors asCPMVP candidates. The affine motion model may be derived by Eq. 1 or Eq.3 above.

Also, in other words, the neighboring blocks may be checked in aspecific order to see whether the neighboring blocks satisfy a specificcondition, and the inherited affine MVP candidates may be derived basedon neighboring blocks satisfying the checked specific condition. Inother words, the neighboring blocks may be checked in a specific orderto see whether the neighboring blocks satisfy the specific condition, afirst inherited affine MVP candidate may be derived based on theneighboring block first checked to satisfy the specific condition, and asecond inherited affine MVP candidate may be derived based on theneighboring block second checked to satisfy the specific condition. Morespecifically, the decoding apparatus may derive motion vectors for CPsof the current block based on the affine motion model of the neighboringblocks first checked to satisfy the specific condition and derive thefirst inherited affine MVP candidate including the motion vectors asCPMVP candidates. Also, the decoding apparatus may derive motion vectorsfor CPs of the current block based on the affine motion model of theneighboring blocks second checked to satisfy the specific condition andderive the second inherited affine MVP candidate including the motionvectors as CPMVP candidates. The affine motion model may be derived byEq. 1 or Eq. 3 above. Meanwhile, the specific condition may indicatethat the neighboring block is coded according to affine motion model,and the reference picture of the neighboring block is the same as thereference picture of the current block. In other words, the neighboringblock satisfying the specific condition may be coded according to affinemotion model (namely, affine prediction is applied to the neighboringblock), and the reference picture is the same as the reference pictureof the current block.

Here, for example, the neighboring blocks may include the leftneighboring block, top neighboring block, top-right corner neighboringblock, bottom-left corner neighboring block, and top-left cornerneighboring block of the current block. In this case, the specific ordermay be an order from the left neighboring block to the bottom-leftcorner neighboring block to the top neighboring block to the top-rightcorner neighboring block to the top-left corner neighboring block.

Or, for example, the neighboring blocks may include only the leftneighboring block and the top neighboring block. In this case, thespecific order may be an order from the left neighboring block to thetop neighboring block.

Or, for example, the neighboring blocks may include the left neighboringblock, and if the top neighboring block belongs to the current CTU whichincludes the current block, the neighboring blocks may further includethe top neighboring block. In this case, the specific order may be anorder from the left neighboring block to the top neighboring block.Also, if the top neighboring block does not belong to the current CTU,the neighboring blocks may not include the top neighboring block. Inthis case, only the left neighboring block may be checked. In otherwords, if the top neighboring block of the current block belongs to thecurrent Coding Tree Unit (CTU) including the current block, the topneighboring block may be used for deriving the inherited affine MVPcandidate, and if the top neighboring block of the current block doesnot belong to the current CTU, the top neighboring block may not be usedfor deriving the inherited affine MVP candidate.

Meanwhile, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, the bottom-left corner neighboring block may be the blockincluding a sample at the coordinates of (−1, H), the left neighboringblock may be the block including a sample at the coordinates of (01,H−1), the top-right corner neighboring block may be the block includinga sample at the coordinates of (W, −1), the top neighboring block may bethe block including a sample at the coordinates of (W−1, −1), thetop-left corner neighboring block may be the block including a sample atthe coordinates of (−1, −1). In other words, the left neighboring blockmay be the left neighboring block at the lowest position among the leftneighboring blocks of the current block, and the top neighboring blockmay be the top neighboring block at the most left position among the topneighboring blocks of the current block.

Also, as one example, if a constructed affine MVP candidate isavailable, the affine MVP candidate list may include the constructedaffine MVP candidate. The decoding apparatus may check whether theconstructed affine MVP candidate of the current block is available, andif the constructed affine MVP candidate is available, the constructedaffine MVP candidate may be derived. Also, for example, after theinherited affine MVP candidate is derived, the constructed affine MVPcandidate may be derived. If the number of derived affine MVP candidates(namely, the number of inherited affine MVPs) is less than 2, and theconstructed affine MVP candidate is available, the affine MVP candidatelist may include the constructed affine MVP candidate. Here, theconstructed affine MVP candidate may include candidate motion vectorsfor the CPs. The constructed affine MVP candidate may be available whenall the candidate motion vectors are available.

For example, if four-parameter affine motion model is applied to thecurrent block, the CPs of the current block may include CP0 and CP1. Ifthe candidate motion vector for the CP0 is available, and the candidatemotion vector for the CP1 is available, the constructed affine MVPcandidate may be available, and the affine MVP candidate list mayinclude the constructed affine MVP candidate. Here, the CP0 mayrepresent the top-left position of the current block, and the CP1 mayrepresent the top-right position of the current block.

The constructed affine MVP candidate may include the candidate motionvector for CP0 and the candidate motion vector for CP1. The candidatemotion vector for CP0 may be the motion vector of a first block, and thecandidate motion vector for CP1 may be the motion vector of a secondblock.

Also, the first block may be a block which has been first confirmedwhile checking neighboring blocks in the first group in a first specificorder to be that a reference picture thereof is the same as a referencepicture of the current block. In other words, the candidate motionvector for CP1 may be the motion vector of the block whose referencepicture first confirmed by checking neighboring blocks within the firstgroup according to a first order is the same as the reference picture ofthe current block. The availability may indicate that the neighboringblock exists, and the neighboring block is coded by inter prediction.Here, if the reference picture of the first block within the first groupis the same as the reference picture of the current block, the candidatemotion vector for CP0 may be available. Also, for example, the firstgroup may include neighboring block A, neighboring block B, andneighboring block C; and the first specific order may be an order fromthe neighboring block A to the neighboring block B, and then to theneighboring block C.

Also, the second block may be a block which has been first confirmedwhile checking neighboring blocks in the second group in a secondspecific order to be that a reference picture thereof is the same as areference picture of the current block. Here, if the reference pictureof the second block within the second group is the same as the referencepicture of the current block, the candidate motion vector for CP1 may beavailable. Also, for example, the second group may include neighboringblock D and neighboring block E, and the second specific order may be anorder from the neighboring block D to the neighboring block E.

Meanwhile, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, neighboring block A may be the block including a sample atthe coordinates of (−1, −1), neighboring block B may be the blockincluding a sample at the coordinates of (0, −1), neighboring block Cmay be the block including a sample at the coordinates of (−1, 0),neighboring block D may be the block including a sample at thecoordinates of (W−1, −1), and neighboring block E may be the blockincluding a sample at the coordinates of (W, −1). In other words,neighboring block A may be the top-left corner neighboring block of thecurrent block, neighboring block B the top neighboring block at the mostleft position among top neighboring blocks of the current block,neighboring block C the left neighboring block at the highest positionamong left neighboring blocks of the current block, neighboring block Dthe top neighboring block at the most right position among topneighboring blocks of the current block, and neighboring block E thetop-right corner neighboring block of the current block.

Meanwhile, if at least one of the candidate motion vector of CP0 and thecandidate motion vector of CP1 is not available, the constructed affineMVP candidate may not be available.

Or, for example, if six-parameter affine motion model is applied to thecurrent block, the CPs of the current block may include CP0, CP1, andCP2. If the candidate motion vector for the CP0 is available, thecandidate motion vector for the CP1 is available, and the candidatemotion vector for the CP2 is available, the constructed affine MVPcandidate may be available, and the affine MVP candidate list mayinclude the constructed affine MVP candidate. Here, the CP0 mayrepresent the top-left position of the current block, the CP1 mayrepresent the top-right position of the current block, and the CP2 mayrepresent the bottom-left position of the current block.

The constructed affine MVP candidate may include the candidate motionvector for CP0, the candidate motion vector for CP1, and the candidatemotion vector for CP2. The candidate motion vector for CP0 may be themotion vector of a first block, the candidate motion vector for CP1 maybe the motion vector of a second block, and the candidate motion vectorfor CP2 may be the motion vector of a third block.

Also, the first block may be a block which has been first confirmedwhile checking neighboring blocks in the first group in a first specificorder to be that a reference picture thereof is the same as a referencepicture of the current block. Here, if the reference picture of thefirst block within the first group is the same as the reference pictureof the current block, the candidate motion vector for CP0 may beavailable. Also, for example, the first group may include neighboringblock A, neighboring block B, and neighboring block C, and the firstspecific order may be an order from the neighboring block A to theneighboring block B, and then to the neighboring block C.

Also, the second block may be a block which has been first confirmedwhile checking neighboring blocks in the second group in a secondspecific order to be that a reference picture thereof is the same as areference picture of the current block. Here, if the reference pictureof the second block within the second group is the same as the referencepicture of the current block, the candidate motion vector for CP1 may beavailable. Also, for example, the second group may include neighboringblock D and neighboring block E, and the second specific order may be anorder from the neighboring block D to the neighboring block E.

Also, the third block may be a block which has been first confirmedwhile checking neighboring blocks in the third group in a third specificorder to be that a reference picture thereof is the same as a referencepicture of the current block. Here, if the reference picture of thethird block within the third group is the same as the reference pictureof the current block, the candidate motion vector for CP2 may beavailable. Also, for example, the third group may include neighboringblock F and neighboring block G, and the third specific order may be anorder from the neighboring block F to the neighboring block G.

Meanwhile, when a size of the current block is W×H, x component of thetop-left sample position of the current block is 0, and y componentthereof is 0, neighboring block A may be the block including a sample atthe coordinates of (−1, −1), neighboring block B may be the blockincluding a sample at the coordinates of (0, −1), neighboring block Cmay be the block including a sample at the coordinates of (−1, 0),neighboring block D may be the block including a sample at thecoordinates of (W−1, −1), neighboring block E may be the block includinga sample at the coordinates of (W, −1), and neighboring block F may bethe block including a sample at the coordinates of (−1, H−1), andneighboring block G may be the block including a sample at thecoordinates of (−1, H). In other words, neighboring block A may be thetop-left corner neighboring block of the current block, neighboringblock B the top neighboring block at the most left position among topneighboring blocks of the current block, neighboring block C the leftneighboring block at the highest position among left neighboring blocksof the current block, neighboring block D the top neighboring block atthe most right position among top neighboring blocks of the currentblock, neighboring block E the top-right corner neighboring block of thecurrent block, neighboring block F the left neighboring block at thelowest position among left neighboring blocks of the current block, andneighboring block G the bottom-left corner neighboring block of thecurrent block.

Meanwhile, if at least one of the candidate motion vector of CP0, thecandidate motion vector of CP1, and the candidate motion vector of CP2is not available, the constructed affine MVP candidate may not beavailable.

Meanwhile, a pruning check process may not be performed between theinherited affine MVP candidate and the constructed affine MVP candidate.The pruning check process may represent a process that checks whetherthe constructed affine MVP candidate is the same as the inherited affineMVP candidate but does not derive the constructed affine MVP candidateif they are found to be identical.

Afterwards, the affine MVP candidate list may be derived based on thesteps described below.

For example, when the number of derived affine MVP candidates is lessthan 2, and the motion vector for CP0 is available, the decodingapparatus may derive a first affine MVP candidate. Here, the firstaffine MVP candidate may be the affine MVP candidate including themotion vector for CP0 as the candidate motion vectors for the CPs.

Also, for example, when the number of derived affine MVP candidates isless than 2, and the motion vector for CP1 is available, the decodingapparatus may derive a second affine MVP candidate. Here, the secondaffine MVP candidate may be the affine MVP candidate including themotion vector for CP1 as the candidate motion vectors for the CPs.

Also, for example, when the number of derived affine MVP candidates isless than 2, and the motion vector for CP2 is available, the decodingapparatus may derive a third affine MVP candidate. Here, the thirdaffine MVP candidate may be the affine MVP candidate including themotion vector for CP2 as the candidate motion vectors for the CPs.

Also, for example, when the number of derived affine MVP candidates isless than 2, the decoding apparatus may derive a fourth affine MVPcandidate including a temporal MVP derived based on a temporalneighboring block of the current block as the candidate motion vectorsfor the CPs. The temporal neighboring block may refer to the samecollocated block within the same collocated picture corresponding to thecurrent block. The temporal MVP may be derived based on the motionvector of the temporal neighboring block.

Also, for example, when the number of derived affine MVP candidates isless than 2, the decoding apparatus may derive a fifth affine MVPcandidate including a zero motion vector as the candidate motion vectorsfor the CPs. The zero motion vector may represent a motion vector whoseelements are all zeros.

The decoding apparatus derives Control Point Motion Vector Predictors(CPMVPs) for Control Points (CPs) of the current block based on theaffine MVP candidate list S2320.

The decoding apparatus may select a specific affine MVP candidate amongthe affine MVP candidates included in the affine MVP candidate list andderive the selected affine MVP candidate as CPMVPs for the CPs of thecurrent block. For example, the decoding apparatus may obtain the affineMVP candidate index for the current block from a bitstream and among theaffine MVP candidates included in the affine MVP candidate list, derivethe affine MVP candidate indicated by the affine MVP candidate index asthe CPMVPs for the CPs of the current block. More specifically, if anaffine MVP candidate includes a candidate motion vector for CP0 and acandidate motion vector for CP1, the candidate motion vector for CP0 ofthe affine MVP candidate may be derived as CPMVP of the CP0, and thecandidate motion vector for CP1 of the affine MVP candidate may bederived as CPMVP of the CP1. Also, if an affine MVP candidate includes acandidate motion vector for CP0, a candidate motion vector for CP1, anda candidate motion vector for CP2, the candidate motion vector for CP0of the affine MVP candidate may be derived as CPMVP of the CP0, thecandidate motion vector for CP1 of the affine MVP candidate may bederived as CPMVP of the CP1, and the candidate motion vector for CP2 ofthe affine MVP candidate may be derived as CPMVP of the CP2. Also, if anaffine MVP candidate includes a candidate motion vector for CP0 and acandidate motion vector for CP2, the candidate motion vector for CP0 ofthe affine MVP candidate may be derived as CPMVP of the CP0, and thecandidate motion vector for CP2 of the affine MVP candidate may bederived as CPMVP of the CP2.

The decoding apparatus derives Control Point Motion Vector Differences(CPMVDs) for the CPs of the current block based on the motion predictioninformation S2330. The motion prediction information may includeinformation on the CPMVD for each CP, and the decoding apparatus mayderive the CPMVD for each of the CPs of the current block based on theinformation on the CPMVD for each of the CPs.

The decoding apparatus derives Control Point Motion Vectors (CPMVs) forthe CPs of the current block based on the CPMVPs and the CPMVDs S2340.The decoding apparatus may derive CPMV for each of the CPs based on theCPMVP and CPMVD for each of the CPs. For example, the decoding apparatusmay derive the CPMV for each CP by adding the CPMVP and CPMVD for theCP.

The decoding apparatus derives prediction samples for the current blockbased on the CPMVs S2350. The decoding apparatus may derive motionvectors of the current block in sub-block or sample units based on theCPMVs. In other words, the decoding apparatus may derive a motion vectorof each sub-block or each sample of the current block based on theCPMVs. The motion vectors in the sub-block or sample units may bederived by Eq. 1 or Eq. 3 above. The motion vectors may be referred toas affine Motion Vector Field (MVF) or motion vector array.

The decoding apparatus may derive prediction samples for the currentblock based on motion vectors in the sub-block or sample units. Thedecoding apparatus may derive a reference region within a referencepicture based on the motion vector in sub-block or sample units andgenerate prediction samples of the current block based on thereconstructed samples within the reference region.

The decoding apparatus generates a reconstructed picture for the currentblock based on the derived prediction samples S2360. The decodingapparatus may generate the reconstructed picture for the current blockbased on the derived prediction samples. According to prediction mode,the decoding apparatus may directly use the prediction samples asreconstructed samples or generate reconstructed samples by addingresidual samples to the prediction samples. In the presence of residualsamples for the current block, the decoding apparatus may obtaininformation on the residuals for the current block from the bitstream.The information on the residuals may include transform coefficients forthe residual samples. The decoding apparatus may derive the residualsamples (or residual sample array) for the current block based on theresidual information. The decoding apparatus may generate reconstructedsamples based on the prediction samples and the residual samples andderive a reconstructed block or a reconstructed picture based on thereconstructed samples. Afterwards, the decoding apparatus may apply thein-loop filtering process such as deblocking filtering and/or SAOprocess to the reconstructed picture to improve subjective/objectiveimage quality depending on the needs, as described above.

FIG. 24 illustrates a decoding apparatus performing a video decodingmethod according to the present disclosure. The method disclosed in FIG.23 may be performed by the decoding apparatus disclosed in FIG. 24. Morespecifically, for example, the entropy decoder of the decoding apparatusof FIG. 24 may perform S2300 step of FIG. 23, the predictor of thedecoding apparatus of FIG. 24 may perform S2310 to S2350 steps, and theadder of the decoding apparatus of FIG. 24 may perform S2360 step ofFIG. 23. Also, although not shown in the figure, the process forobtaining image information including information on the residuals of acurrent block through a bitstream may be performed by the entropydecoder of the decoding apparatus of FIG. 24, and the process forderiving the residual samples for the current block based on theresidual information may be performed by the inverse transformer of thedecoding apparatus of FIG. 24.

According to the present disclosure, efficiency of video coding based onaffine motion prediction may be improved.

Also, according to the present disclosure, in deriving the affine MVPcandidate list, only when all the candidate motion vectors for CPs ofconstructed affine MVP candidates are available, the constructed affineMVP candidates may be added, through which complexity of the process forderiving constructed affine MVP candidates and the process forconstructing an affine MVP candidate list may be reduced, and codingefficiency may be improved.

Also, according to the present disclosure, in deriving the affine MVPcandidate list, additional affine MVP candidates may be derived based oncandidate motion vectors for CPs derived through the process forderiving constructed affine MVP candidates, through which complexity ofthe process for constructing an affine MVP candidate list may bereduced, and coding efficiency may be improved.

Also, according to the present disclosure, in deriving inherited affineMVP candidates, only when a top neighboring block is included in acurrent CTU, the inherited affine MVP candidate may be derived by usingthe top neighboring block, through which the amount of storage of a linebuffer for affine prediction may be reduced, and hardware cost may beminimized.

In the embodiment above, although the methods have been described basedon the flow diagrams by using a series of steps or blocks, the presentdisclosure is not limited to the specific sequence of the steps, andsome steps may be performed at different sequences from the remainingsteps or may be performed simultaneously with the remaining steps.Furthermore, it should be understood by those skilled in the art thatthe steps shown in the flow diagrams are not exclusive, other steps maybe further included, or one or more steps of the flow diagrams may bedeleted without affecting the technical scope of the present disclosure.

The embodiments according to the present disclosure may be implementedand performed on a processor, a micro-processor, a controller, or achip. For example, function units illustrated in each drawing may beimplemented and performed on a computer, a processor, a micro-processor,a controller, or a chip. In this case, information (for example,information on instructions) or algorithm for implementation may bestored in a digital storage medium.

Also, the decoding apparatus and the encoding apparatus to whichembodiments of the present disclosure are applied may include amultimedia broadcast transmission and reception device, a mobilecommunication terminal, a home cinema video device, a digital cinemavideo device, a surveillance camera, a video communication device, areal-time communication device for video communication, mobile streamingdevice, a storage medium, a camcorder, a video on demand (VoD) serviceprovision device, an Over the top (OTT) video device, Internet streamingservice provision device, a 3D video device, a video phone device, atransportation means terminal (for example, vehicle terminal, airplaneterminal, and ship terminal), and a medical video device; and may beused for processing a video signal or a data signal. For example, OTTvideo devices may include a game console, a Bluray player, an Internetconnection TV, a home theater system, a smartphone, a tablet PC, and adigital video recorder (DVR).

Also, a processing method to which embodiments of the present disclosureare applied may be produced in the form of a program executed by acomputer and may be stored in a computer-readable recording medium.Multimedia data having a data structure according to the presentdisclosure may also be stored in a computer-readable recording medium.The computer-readable recording medium includes all kinds of storagedevices and distributed storage devices in which computer-readable dataare stored. The computer-readable recording medium may include, forexample, a Bluray disk (BD), universal serial bus (USB), ROM, PROM,EPROM, EEPROM, RAM, CD-ROM, a magnetic tape, a floppy disk, and anoptical data storage device. Also, the computer-readable recordingmedium includes a media implemented in the form of a carrier (forexample, transmission through the Internet). Also, a bitstream generatedaccording to the encoding method may be stored in a computer-readablerecording medium or transmitted through a wired or a wirelesscommunication network.

Also, the embodiment of the present disclosure may be implemented as acomputer program product in the form of program code, and the programcode may be executed by a computer according to the embodiment of thepresent disclosure. The program code may be stored on acomputer-readable carrier.

FIG. 25 illustrates a content streaming system structure to whichembodiments of the present disclosure are applied.

The content streaming system to which embodiments of the presentdisclosure are applied may largely include an encoding server, astreaming server, a web server, a media storage, a user device, and amultimedia input device.

The encoding server compresses contents input from multimedia inputdevices such as a smartphone, a camera, or a camcorder into digital datato generate a bitstream and transmit the bitstream to the streamingserver. As another example, if multimedia input devices such as asmartphone, a camera, or a camcorder directly generate a bitstream, theencoding server may be omitted.

The bitstream may be generated by an encoding method or a method forgenerating a bitstream to which the embodiments of the presentdisclosure are applied, and the streaming server may temporarily storethe bitstream while the bitstream is transmitted or received.

The streaming server transmits multimedia data to a user device based ona user request through a web server, and the web server serves performsthe role of informing the user of which services are available. If theuser requests a desired service from the web server, the web servertransmits the request to the streaming server, and the streaming servertransmits multimedia data to the user. In this case, the contentstreaming system may include a separate control server. In this case,the control server serves to control commands/responses between deviceswithin the content streaming system.

The streaming server may receive contents from a media storage and/orencoding server. For example, when the contents are received from theencoding server, the contents may be received in real time. In thiscase, in order to provide a smooth streaming service, the streamingserver may store the bitstream for a predetermined time period.

Examples of the user device may include a mobile phone, a smartphone, alaptop computer, a digital broadcasting terminal, a personal digitalassistant (PDA), a portable multimedia player (PMP), a navigationterminal, a slate PC, a tablet PC, a ultrabook, a wearable device (forexample, a smartwatch, smart glasses, and a head mounted display (HMD)),a digital TV, a desktops computer, and digital signage. Each individualserver within the content streaming system may be operated as adistributed server, in which case data received from each server may beprocessed in a distributed manner.

What is claimed is:
 1. A video decoding method performed by a decodingapparatus, comprising: obtaining motion prediction information for acurrent block from a bitstream; constructing an affine Motion VectorPredictor (MVP) candidate list for the current block; deriving ControlPoint Motion Vector Predictors (CPMVPs) for Control Points (CPs) of thecurrent block based on the affine MVP candidate list; deriving ControlPoint Motion Vector Differences (CPMVDs) for the CPs of the currentblock based on the motion prediction information; deriving Control PointMotion Vectors (CPMVs) for the CPs of the current block based on theCPMVPs and the CPMVDs; deriving prediction samples for the current blockbased on the CPMVs; and generating a reconstructed picture for thecurrent block based on the derived prediction samples, wherein theconstructing the affine MVP candidate list comprises: checking whetheran inherited affined MVP candidate is available, wherein the inheritedaffine MVP candidate is derived when the inherited affine MVP candidateis available; checking whether a constructed affine MVP candidate isavailable, wherein the constructed affine MVP candidate is derived whenthe constructed affine MVP candidate is available, and the constructedaffine MVP candidate includes a candidate motion vector for CP0 of thecurrent block, a candidate motion vector for CP1 of the current block,and a candidate motion vector for CP2 of the current block; when thenumber of derived affine MVP candidates is less than 2 and a motionvector for the CP0 is available, deriving a first affine MVP candidate,wherein the first affine MVP candidate is an affine MVP candidateincluding the motion vector for the CP0 as candidate motion vectors forthe CPs; when the number of the derived affine MVP candidates is lessthan 2 and a motion vector for the CP1 is available, deriving a secondaffine MVP candidate, wherein the second affine MVP candidate is anaffine MVP candidate including the motion vector for the CP1 ascandidate motion vectors for the CPs; when the number of the derivedaffine MVP candidates is less than 2 and a motion vector for the CP2 isavailable, deriving a third affine MVP candidate, wherein the thirdaffine MVP candidate is an affine MVP candidate including the motionvector for the CP2 as candidate motion vectors for the CPs; when thenumber of the derived affine MVP candidates is less than 2, deriving afourth affine MVP candidate including a temporal MVP derived based on atemporal neighboring block of the current block as candidate motionvectors for the CPs; and when the number of the derived affine MVPcandidates is less than 2, deriving a fifth affine MVP candidateincluding a zero motion vector as candidate motion vectors for the CPs.2. The method of claim 1, wherein the CP0 represents a top-left positionof the current block, the CP1 represents a top-right position of thecurrent block, and the CP2 represents a bottom-left position of thecurrent block; and the constructed affine MVP candidate is availablewhen the candidate motion vectors are available.
 3. The method of claim2, wherein, when a reference picture of a first block in a first groupis the same as a reference picture of the current block, the candidatemotion vector for the CP0 is available, when a reference picture of asecond block in a second group is the same as the reference picture ofthe current block, the candidate motion vector for the CP1 is available,when a reference picture of a third block in a third group is the sameas the reference picture of the current block, the candidate motionvector for the CP2 is available; and when the candidate motion vectorfor the CP0 is available, the candidate motion vector for the CP1 isavailable, and the candidate motion vector for the CP2 is available, theaffine MVP candidate list includes the constructed affine MVP candidate.4. The method of claim 3, wherein the first group includes a neighboringblock A, a neighboring block B, and a neighboring block C; the secondgroup includes a neighboring block D and a neighboring block E; and thethird group includes a neighboring block F and a neighboring block G;and when a size of the current block is W×H, and an x component and a ycomponent of a top-left sample position of the current block are 0, theneighboring block A is a block including a sample at coordinates of (−1,−1), the neighboring block B is a block including a sample atcoordinates of (0, −1), the neighboring block C is a block including asample at coordinates of (−1, 0), the neighboring block D is a blockincluding a sample at coordinates of (W−1, −1), the neighboring block Eis a block including a sample at coordinates of (W, −1), the neighboringblock F is a block including a sample at coordinates of (−1, H−1), andthe neighboring block G is a block including a sample at coordinates of(−1, H).
 5. The method of claim 4, wherein the first block is a blockwhich has been first confirmed while checking neighboring blocks in thefirst group in a first specific order to be that a reference picture issame as a reference picture of the current block, the second block is ablock which has been first confirmed while checking neighboring blocksin the second group in a second specific order to be that a referencepicture is same as a reference picture of the current block, and thethird block is a block which has been first confirmed while checkingneighboring blocks in the third group in a third specific order to bethat a reference picture is same as a reference picture of the currentblock.
 6. The method of claim 5, wherein the first specific order is anorder from the neighboring block A to the neighboring block B, and thento the neighboring block C, the second specific order is an order fromthe neighboring block D to the neighboring block E, and the thirdspecific order is an order from the neighboring block F to theneighboring block G.
 7. The method of claim 1, wherein availability ofneighboring blocks of the current block is checked in a specific order,and the inherited affine MVP candidates are derived based on anavailable neighboring block checked.
 8. The method of claim 7, whereinthe available neighboring block is a neighboring block coded accordingto affine motion model and whose reference picture is the same as thereference picture of the current block.
 9. The method of claim 8,wherein the neighboring blocks include a left neighboring block and atop neighboring block of the current block.
 10. The method of claim 8,wherein the neighboring blocks include the left neighboring block of thecurrent block, and when the top neighboring block of the current blockis included in a current Coding Tree Unit (CTU) including the currentblock, the neighboring blocks include the top neighboring block of thecurrent block.
 11. The method of claim 9, wherein when the neighboringblocks include the left neighboring block and the top neighboring block,the specific order is an order from the left neighboring block to thetop neighboring block.
 12. The method of claim 11, wherein, when a sizeof the current block is W×H, and an x component and a y component of atop-left sample position of the current block is 0, the left neighboringblock is a block including a sample at the coordinates of (−1, H−1), andthe top neighboring block is a block including a sample at thecoordinates of (W−1, −1).
 13. The method of claim 1, wherein pruningcheck between the inherited affine MVP candidate and the constructedaffine MVP candidate is not performed.
 14. The method of claim 1,wherein, when a top neighboring block of the current block is includedin a current Coding Tree Unit (CTU) including the current block, the topneighboring block is used for deriving the inherited affine MVPcandidate, and when the top neighboring block of the current block isnot included in the current CTU, the top neighboring block is not usedfor deriving the inherited affine MVP candidate.
 15. A video encodingmethod performed by an encoding apparatus, comprising: constructing anaffine Motion Vector Predictor (MVP) candidate list for a current block;deriving Control Point Motion Vector Predictors (CPMVPs) for ControlPoints (CPs) of the current block based on the affine MVP candidatelist; deriving CPMVs for the CPs of the current block; deriving ControlPoint Motion Vector Differences (CPMVDs) for the CPs of the currentblock based on the CPMVPs and the CPMVs; and encoding motion predictioninformation including information on the CPMVDs, wherein theconstructing the affine MVP candidate list comprises: checking whetheran inherited affined MVP candidate of the current block is available,wherein the inherited affine MVP candidate is derived when the inheritedaffine MVP candidate is available; checking whether a constructed affineMVP candidate of the current block is available, wherein the constructedaffine MVP candidate is derived when the constructed affine MVPcandidate is available, and the constructed affine MVP candidateincludes a candidate motion vector for CP0 of the current block, acandidate motion vector for CP1 of the current block, and a candidatemotion vector for CP2 of the current block; when the number of derivedaffine MVP candidates is less than 2 and the motion vector for CP0 isavailable, deriving a first affine MVP candidate, wherein the firstaffine MVP candidate is an affine MVP candidate including the motionvector for the CP0 as candidate motion vectors for the CPs; when thenumber of derived affine MVP candidates is less than 2 and the motionvector for CP1 is available, deriving a second affine MVP candidate,wherein the second affine MVP candidate is an affine MVP candidateincluding the motion vector for the CP1 as candidate motion vectors forthe CPs; when the number of derived affine MVP candidates is less than 2and the motion vector for CP2 is available, deriving a third affine MVPcandidate, wherein the third affine MVP candidate is an affine MVPcandidate including the motion vector for the CP2 as candidate motionvectors for the CPs; when the number of derived affine MVP candidates isless than 2, deriving a fourth affine MVP candidate including a temporalMVP derived based on a temporal neighboring block of the current blockas candidate motion vectors for the CPs; and when the number of derivedaffine MVP candidates is less than 2, deriving a fifth affine MVPcandidate including a zero motion vector as candidate motion vectors forthe CPs.
 16. A non-transitory computer-readable storage medium storing abitstream, the bitstream, when executed, causing a decoding apparatus toperform the following steps: obtaining motion prediction information fora current block from the bitstream; constructing an affine Motion VectorPredictor (MVP) candidate list for the current block; deriving ControlPoint Motion Vector Predictors (CPMVPs) for Control Points (CPs) of thecurrent block based on the affine MVP candidate list; deriving ControlPoint Motion Vector Differences (CPMVDs) for the CPs of the currentblock based on the motion prediction information; deriving Control PointMotion Vectors (CPMVs) for the CPs of the current block based on theCPMVPs and the CPMVDs; deriving prediction samples for the current blockbased on the CPMVs; and generating a reconstructed picture for thecurrent block based on the derived prediction samples, wherein theconstructing the affine MVP candidate list comprises: checking whetheran inherited affined MVP candidate is available, wherein the inheritedaffine MVP candidate is derived when the inherited affine MVP candidateis available; checking whether a constructed affine MVP candidate isavailable, wherein the constructed affine MVP candidate is derived whenthe constructed affine MVP candidate is available, and the constructedaffine MVP candidate includes a candidate motion vector for CP0 of thecurrent block, a candidate motion vector for CP1 of the current block,and a candidate motion vector for CP2 of the current block; when thenumber of derived affine MVP candidates is less than 2 and a motionvector for the CP0 is available, deriving a first affine MVP candidate,wherein the first affine MVP candidate is an affine MVP candidateincluding the motion vector for the CP0 as candidate motion vectors forthe CPs; when the number of the derived affine MVP candidates is lessthan 2 and a motion vector for the CP1 is available, deriving a secondaffine MVP candidate, wherein the second affine MVP candidate is anaffine MVP candidate including the motion vector for the CP1 ascandidate motion vectors for the CPs; when the number of the derivedaffine MVP candidates is less than 2 and a motion vector for the CP2 isavailable, deriving a third affine MVP candidate, wherein the thirdaffine MVP candidate is an affine MVP candidate including the motionvector for the CP2 as candidate motion vectors for the CPs; when thenumber of the derived affine MVP candidates is less than 2, deriving afourth affine MVP candidate including a temporal MVP derived based on atemporal neighboring block of the current block as candidate motionvectors for the CPs; and when the number of the derived affine MVPcandidates is less than 2, deriving a fifth affine MVP candidateincluding a zero motion vector as candidate motion vectors for the CPs.